Abstract: Methods and systems for restoring data are described. According to some embodiments, the method, in response to receiving a first restore request, initiates a second restore request to a hybrid data buffer to route blocks of backup data to the hybrid data buffer. The method further invokes an interrupt service routine (ISR) that is initialized with reserved addresses. When the blocks of backup data are transmitted to the hybrid data buffer, the method further tags, by the ISR, the blocks of backup data to a specified location, where the specified location is one of the reserved addresses.

Abstract: A system that implements a data storage service may store data for a database table in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may back up individual partitions of the table to a remote storage system independently and (in some cases) in parallel, and may update (or create) and store metadata about the table and its partitions on storage nodes of the data storage service and/or in the remote storage system. Backing up each partition may include exporting it from the database in which the table is stored, packaging and compressing the exported partition for upload, and uploading the exported, packaged, and compressed partition to the remote storage system. The remote storage system may be a key-value durable storage system in which each backed-up partition is accessible using its partition identifier as the key.

Abstract: Upon receiving a query at a local database server from a client directed to a LOB stored at a remote database server, a remote LOB locator is created comprising a local LOB locator indicating the LOB's location and a database link associated with the remote database server. The remote LOB locator is communicated to the client, which submits a request to the local database server to perform an operation directed to the LOB. The request is forwarded to the remote database server using the remote LOB locator, where the operation is performed. This mechanism is extended to work with sharded databases. Character set conversions are minimized when returning data to the client from the remote database server. Remote LOB locators may serve as bind variables for DML statements directed to local or remote tables. Local LOB locators may serve as bind variables for DML statements directed to remote tables.

Abstract: Methods, systems, apparatuses, and computer program products are provided for coordinating a distributed database transaction. A transaction driver, such as a client machine, may initiate a distributed transaction. The transaction driver may transmit to a transaction coordinator a driver report that includes identifying information related to the distributed transaction, including an identification of participants involved in the transaction. The coordinator may determine whether participant reports, which include a status of the portion of the distributed database transaction of a particular participant, are received from each of the participants. Participant reports may also identify participants that are descendants of the reporting participant. The transaction coordinator may store, in a table, information to track the progress of the distributed transaction. Using the table, an outcome of the distributed transaction may be determined and transmitted to one or more of the involved participants.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for backup. The method includes: determining a plurality of buffer periods associated with a plurality of pending backup operations of a plurality of objects, each buffer period being a preprocessing period for a corresponding pending backup operation. The method further includes: determining a plurality of predicted execution durations of the plurality of pending backup operations based on historical execution durations of respective historical backup operations of the plurality of objects. The method further includes: determining priorities of the plurality of pending backup operations based on the plurality of predicted execution durations and the plurality of buffer periods. The method further includes: executing the plurality of pending backup operations based on the priorities.

Abstract: Methods for cascade elimination of candidates in spatial relation operations are performed by systems, devices, and apparatuses. Spatial relation operations include counts of geometric objects against geographies/geometries, and data points associated with vertices of shapes representing the geographies/geometries are reduced to form smaller sets of data points that represent the initial shapes. Elimination of geometric objects for operations is performed using inner- and outer-reductions in cascade. Data points are reduced until a representation of the original shape with a specified area or number of data points is generated. Multi-polygon geometries are joined by union based on preservation of area and data points of the polygons therein prior to reducing data points. Cascade reductions are also performed at specified times during spatial operations based on costs associated therewith.

Abstract: Some embodiments may include a process for determining a type of snapshot to be stored using a data storage system. An example the process comprises identifying a snapshot chain for a first virtual machine, determining whether the snapshot chain includes a dependent base file, determining a maximum incremental chain length for the snapshot chain based on whether the snapshot chain includes a dependent base file, or based on an age of the backed up versions within the snapshot chain, determining whether a new snapshot chain should be created based on the maximum incremental chain length, and determining a type of snapshot to be stored for the first virtual machine based on the maximum incremental chain length.

Abstract: Disclosed herein are methods, systems, and processes for source side classification of five and active data. Operating system calls associated with files being accessed or files recently accessed by an endpoint computing device are intercepted. A list including the files is generated and sent to a server computing device. A confirmation is received that a request to classify the files has been received from the server computing device.

Abstract: A server, method, and non-transitory computer readable medium for classifying queries based on contextual information are provided. The server includes a network interface, a memory storage unit and a processor. The method involves receiving a plurality of queries, analyzing the queries and determining a likelihood divergence and selecting a domain. The non-transitory computer readable medium is encoded with programming instructions to direct a processor to carry out the method.

Abstract: Embodiments for a method of storing documents using a document data protection process. Documents are first compressed and stored in a container along with selected metadata. An Document Record is created for each document. A Container Record is created for each newly created container, and a Backup Record is created for each container for each backup. Once the required records are created, the process facilitates the execution of backup operations, such as full or incremental backups of the stored documents. Data tiering is supported so that low cost object storage in the public cloud is used instead of expensive processing methods like deduplication. A user interface receives a user setting dictating a storage media storing the container based on a relative availability of the storage media versus cost of storage.

Abstract: The present disclosure relates to determining domain names of a group entity using electronic activities and systems of record. A method can include maintaining a plurality of node profiles including one or more node field-value pairs. Each node profile of the plurality of node profiles can identify a group entity. The method can include identifying a first domain name corresponding to the group entity. The method can include accessing a plurality of data points corresponding to a subset of the plurality of node profiles. The method can include updating each respective node profile of the subset to include a respective second electronic account identifier corresponding to the node profile. The method can include storing, in at least one first data structure, an association between the group entity, the first domain name, and a second domain name corresponding to the second electronic account identifiers.

Abstract: Examples disclosed herein involve data stream analytics. In examples herein, a data stream may be analyzed by computing a set of hashes of a real-valued vector, the real-valued vector corresponding to a sample data object of a data stream; generating a list of data objects from a database corresponding to the sample data object based on the set of hashes, the list of data objects ordered based on similarity of the data objects to the sample data object of the data stream; and updating a data structure representative of activity of the sample data object in the data stream based on the list of data objects, the data structure to provide incremental analysis corresponding to the sample data object.

Abstract: A method includes extracting variable length strings from text data, associating the extracted strings with indexes in an indexing structure that maintain identifiers for instances of the strings in the text data, selecting a set of the strings having corresponding indexes whose size exceeds a threshold size value, and determining whether to merge a first index corresponding to a first string with a second index corresponding to a second string, the second string being a sub string of the first string, wherein the determination is based at least in part on a comparison of a first size of the first index and a second size of the second index. The method further includes merging the first index with the second index to create a merged index in the indexing structure responsive to the determination, and processing queries to the text data utilizing the indexing structure with the merged index.

Abstract: The preferred embodiments described below include methods, systems and computer readable media for cross discipline data validation checking in a multidisciplinary system. One or more multidisciplinary validation rules are used to perform cross discipline data validation checking to determine whether multidisciplinary data is consistent across engineering disciplines. The multidisciplinary validation rules define the scope of the validation checking within the engineering application (307) associated each engineering discipline. The results of the validation check are provided to the user.

Abstract: Systems and methods are disclosed for implementing enhanced security measures that include utilizing a backup database included on node devices connected to a CAN bus, so that certain message identifiers are updated according to a matching table stored on the backup database. By updating the message identifiers, outside attackers will not be privy to the new message identifier assigned to the messages and will no longer target such messages.

Abstract: Methods, systems and computer program products for organizing and displaying in real-time data related to a plurality of documents. A plurality of documents and a plurality of entity identifiers are stored in a relational database storage. Each entity identifier has an entity type selected from a plurality of entity types. A plurality of entity associations between the plurality of entity identifiers and the plurality of documents are stored in a non-relational database storage. Each entity association defines a relationship between one or more entity identifiers and a selected document in the plurality of documents. A plurality of file icons are displayed in a display interface. The plurality of file icons includes active icons corresponding to a selection of the plurality of documents where the selection is determined by querying the non-relational database storage using at least one currently-selected entity identifier.

Abstract: Example methods and systems for indexing fingerprints are described. Fingerprints may be made up of sub-fingerprints, each of which corresponds to a frame of the media, which is a smaller unit of time than the fingerprint. In some example embodiments, multiple passes are performed. For example, a first pass may be performed that compares the sub-fingerprints of the query fingerprint with every thirty-second sub-fingerprint of the reference material to identify likely matches. In this example, a second pass is performed that compares the sub-fingerprints of the query fingerprint with every fourth sub-fingerprint of the likely matches to provide a greater degree of confidence. A third pass may be performed that uses every sub-fingerprint of the most likely matches, to help distinguish between similar references or to identify with greater precision the timing of the match. Each of these passes is amenable to parallelization.

Abstract: Provenance analysis systems and methods. Datums representing relationships between entities can be stored in a knowledge store. Datums can be received from agents as agents perform activities. Activity records are be stored in a provenance graph, the activity record and associate received datums with any input datums used in the activity. Provenance subgraphs can 5 be retrieved by traversing the provenance graph for selected datums and presented through a user interface. Provenance subgraphs can be augmented with trust modifiers determined based on attributions, confidences, and refutations provided by a user. Trust modifiers can be propagated downstream to enable the addressing of junctions in variable confidence.

Abstract: An optimal solution search method for searching for an optimal solution in a combinatorial optimization problem using a computer, includes: acquiring a first solution candidate; and enumerating and indexing solution candidate groups of which the degree of divergence from the first solution candidate is equal to or smaller than a predetermined range; equally extracting second solution candidates from the enumerated and indexed solution candidate groups assigning evaluation values to the second solution candidates; and determining whether the search for the optimal solution is terminated on the basis of the evaluation value. In a case where the search for the optimal solution is not terminated, the current first solution candidate is updated as the best second solution candidate selected from the second solution candidates, and the processes are repeated until the search for the first optimal solution is terminated.

Abstract: A method for data processing includes obtaining from multiple different organizations (24, 52, 54, 56) customer relationship management (CRM) records (110) and communication records (90). Reference vectors (130) of feature values are computed for the communication records in a training set. Global weights are computed for the feature values by evaluating the reference vectors for all of the different organizations. For each organization, respective company weights are computed by evaluating specifically the reference vectors computed over the CRM records and communication records belonging to the organization. For each person belonging to a given organization, respective user weights are computed for the feature values by evaluating specifically the reference vectors computed over the communication records that identify the person as the user. The weights are applied in order to assign the communication records that are not in the training set to respective ones of the CRM records.