Abstract: A technique includes acquiring a plurality of write requests from at least one memory controller and logging information associated with the plurality of write requests in persistent storage. The technique includes applying the plurality of write requests atomically as a group to persistent storage.

Abstract: Approaches for structuring a plurality of page images in-memory are described in various examples of the present disclosure. In one example, a unique page identifier provided within a reference page image is identified. The unique page identifier is associated with a target page image stored in-memory. Once identified, the page identifier associated with the target page image is replaced with a location specific identifier of the target page image, wherein the location specific identifier is based on an in-memory location of the target page image.

Abstract: A technique includes acquiring a plurality of write requests from at least one memory controller and logging information associated with the plurality of write requests in persistent storage. The technique includes applying the plurality of write requests atomically as a group to persistent storage.

Abstract: A method for mapping virtual memory pages to physical memory pages is described. The method includes receiving a mapping of a virtual memory page to multiple physical memory pages, detecting a request for a transaction to be performed on data contained in the multiple physical memory pages, in which the transaction includes a number of data updates, determining which of the number of multiple physical memory pages contains a latest version of the data to be updated by the transaction, updating a physical memory page by performing the transaction within a physical memory page among the multiple physical memory pages that does not contain the latest version of the data, and updating an indication of which of the physical memory pages contains the latest version of the data pertaining to the transaction.

Abstract: A set of jobs to be scheduled is identified (402) in a system including a processing pipeline having plural processing stages that apply corresponding different processing to a data update to allow the data update to be stored. The set of jobs is based on one or both of the data update and a query that is to access data in the system. The set of jobs is scheduled (404) by assigning resources to perform the set of jobs, where assigning the resources is subject to at least one constraint selected from at least one constraint associated with the data update and at least one constraint associated with the query.

Abstract: Example embodiments relate to providing file metadata queries for file systems using representational state transfer compliant (RESTful) application programming interfaces. In example embodiments, a representational state transfer (REST) request that includes requested attributes and search parameters is received. Then, a metadata source including source attributes that correspond to the requested attributes is identified using the translation configuration. The translation configuration of the metadata source is also used to convert the search parameters to obtain converted parameters that are compatible with the metadata source. At this stage, a metadata query for the metadata source that includes the requested attributes and the converted parameters is created.

Abstract: An embodiment of a method of restoring backup data comprises first and second steps that preferably are executed at least partially in parallel. The first step restores an incremental backup. The second step selectively restores a full backup. The selective restoration of the full backup disregards units of data that were restored from the incremental backup and restores a remainder of the full backup. In an alternative embodiment, the first step precedes the second step. In another alternative embodiment, the selective restoration of the full backup accesses a table that indicates the units of data contained in the incremental backup to determine which units of data to disregard in the full backup.

Abstract: An embodiment of a method of writing data begins with a first step of generating a timestamp. A second step issues a query that includes the timestamp to each of a plurality of primary storage devices. The method continues with a third step of receiving a query reply from at least a quorum of the primary storage devices. The query replies indicate that the timestamp is later than an existing timestamp for the data. In a fourth step, the data is mirrored to secondary storage after receiving the query reply from at least the quorum of the primary storage devices. Upon receiving a mirror completion message from the secondary storage, a fifth step issues a write message that includes at least a portion of the data and the timestamp to each of the primary storage devices.

Abstract: Embodiments include methods, apparatus, and systems for snapshots in distributed storage systems. One method of software execution includes using a version tree to determine what data blocks are shared between various storage nodes in the version tree in order to create a clone or a snapshot of a storage volume in a distributed storage system that uses quorum-based replication.

Abstract: A set of jobs to be scheduled is identified (402) in a system including a processing pipeline having plural processing stages that apply corresponding different processing to a data update to allow the data update to be stored. The set of jobs is based on one or both of the data update and a query that is to access data in the system. The set of jobs is scheduled (404) by assigning resources to perform the set of jobs, where assigning the resources is subject to at least one constraint selected from at least one constraint associated with the data update and at least one constraint associated with the query.

Abstract: The present invention provides techniques for assignment and layout of redundant data in data storage system. In one aspect, the data storage system stores a number M of replicas of the data. Nodes that have sufficient resources available to accommodate a requirement of data to be assigned to the system are identified. When the number of nodes is greater than M, the data is assigned to M randomly selected nodes from among those identified. The data to be assigned may include a group of data segments and when the number of nodes is less than M, the group is divided to form a group of data segments having a reduced requirement. Nodes are then identified that have sufficient resources available to accommodate the reduced requirement. In other aspects, techniques are providing for adding a new storage device node to a data storage system having a plurality of existing storage device nodes and for removing data from a storage device node in such a data storage system.

Abstract: Multiple file system events are detected on one or more nodes of a file system, each file system event corresponding to an operation that is to be performed on the file system. Each of the multiple system events are durably recorded as an entry for a journal of the file system prior to either performance or completion of the corresponding operation. A programmatic component that is external to the file system can process entries from the journal, and in response, the entries can be expired from the journal.

Abstract: In at least some examples, a system includes a distributed database and control logic to enable updates and queries to the distributed database. The control logic applies a plurality of identifiers to the updates and queries to maintain distinct fault domains in the distributed database.

Abstract: To identify similar files in an environment having multiple client computers, a first client computer receives, from a coordinator computer, a request to find files located at the first client computer that are similar to at least one comparison file, wherein the request has also been sent to other client computers by the coordinator computer to request that the other client computers also find files that are similar to the at least one comparison file. In response to the request, the first client computer compares signatures of the files located at the first client computer with a signature of the at least one comparison file to identify at least a subset of the files located at the first client computer that are similar to the at least one comparison file according to a comparison metric. The first client computer sends, to the coordinator computer, a response relating to the comparing.

Abstract: A system has a processing pipeline with a plurality of processing stages, where each of the processing stages has one or plural processors, and where the processing stages are individually and independently scalable. A first of the processing stages of the processing pipeline provides a received date update into an update data structure, where the update data structure is accessible to process a query received by the system. One or more additional of the processing stages transforms the update data structure to allow for merging of the transformed update data structure into a database, where the transformed update data structure is accessible to process the query. Content of the transformed update data structure is stored into the database.

Abstract: A computer system that includes a graphical user interface used to organize a group of documents is provided. The system includes a processor that is adapted to execute machine-readable instructions. The system also includes a storage device that is adapted to store data. The data includes a plurality of documents and instructions that are executable by the processor to generate the graphical user interface. The graphical user interface includes a cluster map that includes the results of a clustering algorithm applied to the documents. The graphical user interface also includes a principal documents screen that includes a principal document that is identified by weighting each of the documents in a cluster based, at least in part, on an occurrence of representative terms in the document. The representative terms are terms that have been identified by the clustering algorithm as being more effective for distinguishing between documents that belong to different clusters.

Abstract: A system has a processing pipeline with a plurality of processing stages, where each of the processing stages has one or plural processors, and where the processing stages are individually and independently scalable. A first of the processing stages of the processing pipeline provides a received date update into an update data structure, where the update data structure is accessible to process a query received by the system. One or more additional of the processing stages transforms the update data structure to allow for merging of the transformed update data structure into a database, where the transformed update data structure is accessible to process the query. Content of the transformed update data structure is stored into the database.

Abstract: An embodiment of a method of writing data includes issuing write messages to a replica set of storage devices. Write confirmations are received from at least a majority of the storage devices. An embodiment of a method reading data includes issuing read messages to a replica set of storage devices. Read confirmations are received from at least a first majority of the storage devices. Read commit messages are issued to the storage devices. Commit confirmations are received from at least a second majority of the storage devices.

Abstract: To identify similar files in an environment having multiple client computers, a first client computer receives, from a coordinator computer, a request to find files located at the first client computer that are similar to at least one comparison file, wherein the request has also been sent to other client computers by the coordinator computer to request that the other client computers also find files that are similar to the at least one comparison file. In response to the request, the first client computer compares signatures of the files located at the first client computer with a signature of the at least one comparison file to identify at least a subset of the files located at the first client computer that are similar to the at least one comparison file according to a comparison metric. The first client computer sends, to the coordinator computer, a response relating to the comparing.

Abstract: Read, write and recovery operations for replicated data are provided. In one aspect, a system for redundant storage of data included a plurality of storage devices and a communication medium for interconnecting the storage devices. At least two of the storage devices are designated devices for storing a block of data. Each designated device has a version of the data and a first timestamp that is indicative of when the version of data was last updated and a second timestamp that is indicative of any pending update to the block of data. The read, write and recovery operations are performed to the data using the first and second timestamps to coordinate the operations among the designated devices.