Abstract: A technique includes using a primary commit coordinator in a distributed file system as a participant in at least one transaction associated with a file operation to commit the transaction(s) to an associated storage segment of the file system. The primary commit coordinator is used to communicate with at least one other participant in the transaction(s) using a three phase commit protocol to generate transaction states associated with committing the transaction(s). The technique includes selectively checkpointing the transaction states to a backup commit coordinator that is associated with the primary commit coordinator to allow the backup commit coordinator to takeover committing the transaction.

Abstract: Examples disclosed herein relate to locally polling the value of a flag to determine whether a resource is free for a thread to use in a system with multiple processing nodes that are incoherent with regards to each other. A flag in a direct attached memory to one of the processing nodes is set to indicate that the resource is not free for the thread to use. A previous tail of a lock list is determined from a list master. The previous tail is located on another one of the processing nodes.

Abstract: Examples disclosed herein relate to locally polling the value of a flag to determine whether a resource is free for a thread to use in a system with multiple processing nodes that are incoherent with regards to each other. A flag in a direct attached memory to one of the processing nodes is set to indicate that the resource is not free for the thread to use. A previous tail of a lock list is determined from a list master. The previous tail is located on another one of the processing nodes.

Abstract: Example implementations may relate to a version controller allocating a copy page in persistent memory upon receiving, from an application executing on a processor, a copy command to version an image page for an atomic transaction. The version controller may receive application data addressed to a cache line of the image page, and may write the application data to a cache line of the copy page corresponding to the addressed cache line of the image page. If the version controller receives a replace-type transaction commit command, the version controller may generate a final page by either forward merging the image page into the copy page or backward merging the copy page into the image page, depending a merge direction policy.

Abstract: Example implementations may relate to a version controller allocating a copy page in persistent memory upon receiving, from an application executing on a processor, a copy command to version an image page for an atomic transaction. The version controller may receive application data addressed to a cache line of the image page, and may write the application data to a cache line of the copy page corresponding to the addressed cache line of the image page. If the version controller receives a replace-type transaction commit command, the version controller may generate a final page by either forward merging the image page into the copy page or backward merging the copy page into the image page, depending a merge direction policy.

Abstract: A technique includes using a primary commit coordinator in a distributed file system as a participant in at least one transaction associated with a file operation to commit the transaction(s) to an associated storage segment of the file system. The primary commit coordinator is used to communicate with at least one other participant in the transaction(s) using a three phase commit protocol to generate transaction states associated with committing the transaction(s). The technique includes selectively checkpointing the transaction states to a backup commit coordinator that is associated with the primary commit coordinator to allow the backup commit coordinator to takeover committing the transaction.

Abstract: The present disclosure is generally related to replicating metadata. A method includes accessing a first file with a first unique identifier at a source location in a storage device, wherein metadata corresponding to the first file is stored in a first database with the first unique identifier. The method includes replicating the first file to produce a second file at a target location, wherein the second file has a second unique identifier. The method includes replicating the metadata and the first unique identifier to a second database. The method includes mapping the second unique identifier to the first unique identifier in the second database.

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: 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: A data processing system includes a plurality of processing stages. In response to a query, a membership structure is accessed to determine whether partially processed data from a particular one of the processing stages.

Abstract: A technique receiving identifiers from a plurality of nodes. Each identifier identifies an associated data object, and at least some of the data objects being replicated on different nodes. The technique includes scheduling analysis of the data objects on the nodes based at least in part on a distribution of replicas of the data objects among the nodes and modeled performances of the nodes.

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: Data sharing methods and data sharing system are disclosed. An example method includes providing, using a logic circuit, access to a first file associated with a first user to a second user different from the first user; identifying a second file in response to a query submitted by the first user; and prohibiting, using the logic circuit, a third user from accessing the second file.

Abstract: A data processing system includes a plurality of processing stages. In response to a query, a membership structure is accessed to determine whether partially processed data from a particular one of the processing stages.

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: To determine files associated with one or more workflows, a trace of accesses of files in at least one server is received. The files are grouped into at least one set of files, where the files in the set are accessed together more than a predetermined number of times in the trace. Files associated with the particular workflow are identified based on the at least one set.

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.