Abstract: Data storage system conflict management techniques are described. In one example, data is sent by client devices to both a repository system and a search index system of a data storage system. Each of the client devices maintains, locally, records of changes to data of the repository system, e.g., through use of an invertible Bloom lookup table. The records are used as a basis by the client devices to send reports to an arbiter system and used to detect conflicts When detected, a conflict request is communicated to client devices involved in the conflict as well as to the repository system and responses used to generate a correction that is communicated to update the repository system and search index system.

Abstract: Data storage system conflict management techniques are described. In one example, data is sent by client devices to both a repository system and a search index system of a data storage system. Each of the client devices maintains, locally, records of changes to data of the repository system, e.g., through use of an invertible Bloom lookup table. The records are used as a basis by the client devices to send reports to an arbiter system and used to detect conflicts When detected, a conflict request is communicated to client devices involved in the conflict as well as to the repository system and responses used to generate a correction that is communicated to update the repository system and search index system.

Abstract: Data storage system conflict management techniques are described. In one example, data is sent by client devices to both a repository system and a search index system of a data storage system. Each of the client devices maintains, locally, records of changes to data of the repository system, e.g., through use of an invertible Bloom lookup table. The records are used as a basis by the client devices to send reports to an arbiter system and used to detect conflicts When detected, a conflict request is communicated to client devices involved in the conflict as well as to the repository system and responses used to generate a correction that is communicated to update the repository system and search index system.

Abstract: A flexible, scalable, and fast query system for a distributed execution environment is provided. An example method includes receiving a plurality of processor summaries, each including a list of job digests, each job digest including a job identifier for a job running on a job processor and a payload portion. The method can also include, for each job digest, determining a location in a probabilistic payload data structure for the job digest and storing the payload portion and a fingerprint portion generated from a portion of a hash of the job identifier in an entry at the location as a job summary and responding to queries using the probabilistic payload data structure. Responding to a particular query may include identifying job properties corresponding to parameters of the particular query, updating job property statistics, and using the job property statistics to change the job properties represented in the payload portion.

Abstract: A flexible, scalable, and fast query system for a distributed execution environment is provided. An example method includes receiving a plurality of processor summaries, each including a list of job digests, each job digest including a job identifier for a job running on a job processor and a payload portion. The method can also include, for each job digest, determining a location in a probabilistic payload data structure for the job digest and storing the payload portion and a fingerprint portion generated from a portion of a hash of the job identifier in an entry at the location as a job summary and responding to queries using the probabilistic payload data structure. Responding to a particular query may include identifying job properties corresponding to parameters of the particular query, updating job property statistics, and using the job property statistics to change the job properties represented in the payload portion.

Abstract: Systems and methods herein provide for a clustered content management comprising at least two computing nodes. A first node comprises an instance of the content repository. The first computing node may perform content management operations on its instance of the content repository. Changes to the instance of the content repository of the first computing node are synchronized with the content repository by way of a second computing node. The second computing node is communicatively coupled to the first computing node through a network and is operable to synchronize the change with the content repository. The second computing node also determines that synchronization of the change is blocked due to an error. The second computing node identifies the error, determines that the error is correctable, and corrects the error to synchronize the change with the content repository.

Abstract: Systems and methods herein provide for a clustered content management comprising at least two computing nodes. A first node comprises an instance of the content repository. The first computing node may perform content management operations on its instance of the content repository. Changes to the instance of the content repository of the first computing node are synchronized with the content repository by way of a second computing node. The second computing node is communicatively coupled to the first computing node through a network and is operable to synchronize the change with the content repository. The second computing node also determines that synchronization of the change is blocked due to an error. The second computing node identifies the error, determines that the error is correctable, and corrects the error to synchronize the change with the content repository.