Abstract: According to certain aspects, an information management system may instruct a first secondary storage computing device in a set of secondary storage computing devices to initiate a restore of a first group of a plurality of files from a first storage device associated with the first secondary storage computing device, the first group including a first file. The computing system may instruct a second secondary storage computing device in the set to initiate a restore a second group of the plurality of files from a second storage device associated with the second secondary storage computing device, the second group including the first file. The computing system can, upon receiving notification that the restore of the first file from the first storage device has completed prior to completion of the restore of the first file from the second storage device, cancel restoration of the first file from the second storage device.

Abstract: A solution is proposed for managing each one of a plurality of computing machines. A corresponding method comprises taking one or more snapshots of the computing machine or part thereof, the snapshots being organized in a snapshot tree of nodes representing the snapshots according to a dependency thereof, expanding the snapshot tree of the computing machine according to each sub-tree of the snapshot tree of each other computing machine having the snapshot of a parent node of the sub-tree matching a graft node of the snapshot tree of the computing machine, the sub-tree being appended to the graft node, selecting a snapshot of the other computing machines represented by a selected node of the snapshot tree of the computing machine, and restoring the selected snapshot on the computing machine.

Abstract: Systems and methods to provide tracing of data through a transformation process using tracers added to the data during the transformation. In one embodiment, a method includes: receiving a plurality of data records; processing the data records using a plurality of transformation rules, wherein each of the transformation rules corresponds to a respective one of a plurality of tracers; and adding the tracers to the data records as needed to indicate those of the transformation rules used to process each data record. After processing the data records using the transformation rules, the data records are provided to a target system, and the transformation process is validated using the tracers added to the data records.

Abstract: The disclosure generally describes computer-implemented methods, software, and systems for generating and executing queries. A query is received. A set of structure elements associated with the query is determined, wherein the structure elements are used for accessing, in a database, data tuples associated with the set of structure elements. Optionally, the set of structure elements is reduced for accessing data tuples to the structure elements selected. Contributing structure elements are added to the reduced set to not produce objects in the result set but for creating associated objects. Contributing structure elements are handled in an optimized way to keep the data set on which the query result set is calculated as small as possible. This is done by using the smallest set of characteristics in the group-by clause for retrieving the data set to calculate the requested set of structure elements. A result set of the query is provided.

Abstract: A column set server adapts to data use patterns by data consumers by modifying how a table produced by a data producer is partitioned into separate column sets to reduce the waste incurred in accessing the data by multiple consumers of the data. For example, the column set server adjusts a column set distribution when a new consumer process is added, when one is retired, or when relative data set size ratios change.

Abstract: Computing devices may synchronize respective copies of a repository in part by sharing status information for records stored in the repository. Status information may be conveyed by encoding record identifiers in a hashtable. A hash function may be selected to have an output range equal to or larger than a number of records in the repository. A plurality of hash function outputs may be mapped to a storage location containing a sum of identifiers and a count of identifiers included in the sum. The storage location may be transmitted to a remote computing device, which may unfold the data in the storage location to identify changed records.

Abstract: Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block.

Abstract: A system and method for providing contextual analytics data receives display entity data into a first virtual container, the display entity data including one or more instructions of the first virtual container. Instructions performing process operations are present within a second virtual container isolated from the first virtual container. The display entity data is analyzed to identify a webpage, for example, associated with the display entity data. If necessary, executable code is injected into the first virtual container in order to expose data of the first virtual container to the operations of the second virtual container so that further identification of the display entity may be made. A request is made by the second virtual container to one or more computing systems to provide available analytics data pertaining to the display entity data, after which the available analytics data is displayed for a user.

Abstract: A method for improving the presentation of social media data from multiple social network feeds is provided. The method may include aggregating social media content received from the multiple social network feeds. The method may also include generating filtered data by eliminating repetitive data from among the received aggregated social media content. The method may further include analyzing the filtered data for determining at least one data category and presenting a digest of social media content based on the determined at least one data category.

Abstract: Methods and apparatus are provided for performing source-side merging of distributed transactions prior to replication, wherein a distributed transaction occurs at a plurality of nodes. A first node includes a database and an audit trail that stores database change events from the database of the first node. One or more other nodes each include a database and an audit trail that stores database change events from the database of the respective node. In use, a transaction is initiated which updates the database of the first node and the database at one or more of the other nodes. The database updates are captured in the audit trails of the respective nodes involved with the transaction. The first node receives and merges the database change events from the audit trails of each of the nodes involved in the transaction. The merged database change events are replicated via a replication engine only from the first node.

Abstract: Various disclosed embodiments include methods and systems for managing lock or latch chains in concurrent execution of database queries. A method includes receiving a plurality of transactions, each transaction associated with one or more queuing requests. The method includes, for each transaction, determining one or more partition sets. Each partition set corresponds to one or more database partitions needed for the transaction. The one or more database partitions are included within a partitioned database. The method includes, for each transaction, determining one or more queues needed for the transaction and storing a bitmap representation of the one or more queues needed for the transaction. The one or more queues needed for the transaction correspond to the one or more database partitions needed for the transaction.

Abstract: A log record from a host machine node includes terms. Frequency of occurrence of the terms across a stream of log records is determined. Based on the frequency satisfying a threshold, a Bloom filter vector is selected from among a plurality of Bloom filter vectors based on the frequency, the Bloom filter vector is updated based on the terms, and an identifier for the log record is stored with an association to the Bloom filter vector. In contrast, based on the frequency of occurrence not satisfying the defined frequency range, a type identifier is identified based on the terms, a Bloom filter vector is selected from among the plurality of Bloom filter vectors based on the type identifier, the Bloom filter vector is updated based on the terms, and an identifier for the log record is stored with an association to the Bloom filter vector.

Abstract: A method for synchronizing a file system (FS) and a remote file system (RFS) includes monitoring the FS for FS events, generating FS event records, receiving RFS event records of RFS events, generating file system operations (FSOs) based on the FS and RFS event records, and communicating the FSOs to the FS and RFS to synchronize them. A method for generating the FSOs includes accessing a plurality of FS and/or RFS event records, processing the accessed records to generate processed event records, generating the FSOs based on the processed event records, and outputting the FSOs to cause synchronization of the FS and RFS. Systems are also described. The invention facilitates event-based, steady-state synchronization of local and remote file systems.

Abstract: Systems and methods are disclosed for checking the data integrity of a data object copied between storage pools in a storage system by comparing data fingerprints of data objects, by scheduling a series of successive copy operations over time for copying a data object from a source data store to a target data store; generating a partial fingerprint of the data object at the source data store using a data fingerprinting operation that creates a fingerprint from a subset of data of the data object; sending the partial fingerprint of the data object to the target data store; sending any new data contents for the data object to the target data store; and creating a partial fingerprint of the data object at the target data store and comparing it to the partial fingerprint sent to the target data store to determine if they differ.

Abstract: A data structure and method of accessing, modifying, and adding data in the data structure are provided. The data structure includes an encoding dictionary, a decoding dictionary, and an attribute vector. The attribute vector includes information for cross-referencing characteristics associated with the same entry. Responsive to an instruction to add data, the method adds data to the encoding and decoding dictionaries as an entry and assigns a valueID for the added entries. The method then adds the valueID to attribute vector(s) associated with the dictionaries. Responsive to a query for data associated with a value, the method searches for the value in an encoding dictionary, determines a valueID corresponding to the data based on a match in the encoding dictionary, uses the attribute vector to find all relevant data across all dictionaries and attribute vectors, assembles the retrieved information in a tuple, then outputs all data associated with the value.

Abstract: A retrieval method and system are disclosed. The method involves: A). searching a catalog table of retrieval keywords based on a retrieval keyword inputted by a user at a terminal, and acquiring a first data terms set including the inputted retrieval keyword; B). searching a data table of information index based on each data term of the first data terms set related to the inputted retrieval keyword, and acquiring a second data terms set; C). combining and sending the first data terms set to the terminal wherein the first data terms set is combined in a way of recursion, and sending the second data terms set to the terminal. The solution extracts semantics by formalizing retrieval character strings, and guides and returns retrieval information, thereby improving the deterministic, logic and efficiency of retrieval and user experience.

Abstract: A method for synchronizing a file system (FS) and a remote file system (RFS) includes monitoring the FS for FS events, generating FS event records, receiving RFS event records of RFS events, generating file system operations (FSOs) based on the FS and RFS event records, and communicating the FSOs to the FS and RFS to synchronize them. A method for generating the FSOs includes accessing a plurality of FS and/or RFS event records, processing the accessed records to generate processed event records, generating the FSOs based on the processed event records, and outputting the FSOs to cause synchronization of the FS and RFS. Systems are also described. The invention facilitates event-based, steady-state synchronization of local and remote file systems.

Abstract: A method for autonomic data partition placement in an in-memory data grid (IMDG) based on usage sampling is provided. The method may include sampling access pattern data, during a configurable window, of a client accessing one or more data objects in the IMDG. Analytics are applied to the sampled access pattern data to determine a replacement partition schema, based on the analyzed sampled access pattern data exceeding at least one performance threshold. The deployed partition schema is altered, based on the replacement partition schema.

Abstract: An apparatus, system, and method are disclosed for maintaining a context stack. A monitor module monitors a stack size after each monitor interval for a stack of a plurality of contexts. Each context defines communications between a process and a data set and comprises a pathway for communicating with the data set and a process identifier. A stack module deallocates a context that satisfies a stack policy from the stack if the stack size is within a buffer threshold of a maximum threshold.

Abstract: Log based replication using parallel scanners is described. An example method includes establishing replication paths from a primary database to a plurality of destination servers. A plurality of scanner threads are spawned to scan a transaction log of the primary database. Specifically, one scanner thread is assigned to each replication path corresponding to each destination server. For each scanner thread, data bound to a replication path associated with the scanner thread is selected from a subset of the transaction log. Accordingly, the data is distributed to a destination server associated with the replication path.