Abstract: Technology is disclosed for selectively compressing data based on similarity of pages within the data that is to be compressed. At least one corresponding hash value is generated for each one of multiple candidate pages to be compressed. In response to the hash values generated for the candidate pages, the technology selects a set of similar candidate pages from the candidate pages. The set of similar candidate pages are a subset of the candidate pages that includes less than all the candidate pages. The set of similar candidate pages are compressed as a single unit, separately from one or more other ones of the candidate pages that were not selected to be included in the set of similar candidate pages.

Abstract: Technology is disclosed for selectively compressing data based on similarity of pages within the data that is to be compressed. At least one corresponding hash value is generated for each one of multiple candidate pages to be compressed. In response to the hash values generated for the candidate pages, the technology selects a set of similar candidate pages from the candidate pages. The set of similar candidate pages are a subset of the candidate pages that includes less than all the candidate pages. The set of similar candidate pages are compressed as a single unit, separately from one or more other ones of the candidate pages that were not selected to be included in the set of similar candidate pages.

Abstract: Disclosed is a method, apparatus, and system for processing a data update message in a multi-agent system comprising a plurality of agents, the operations comprising: receiving, at a second agent, the data update message comprising data for a node in a shared data tree and a first node context map from a first agent, the first node context map comprising last known contexts of all the agents for the node according to knowledge of the first agent; determining, at the second agent, whether any of three conditions relating to the first node context map and a second node context map is true, the second node context map comprising last known contexts of all the agents for the node according to knowledge of the second agent; and in response to determining that none of the three conditions relating to the first node context map and the second node context map is true, updating, at the second agent, the node based on the data update message from the first agent.

Abstract: Disclosed is a method, apparatus, and system for processing a data update message in a multi-agent system comprising a plurality of agents, the operations comprising: receiving, at a second agent, the data update message comprising data for a node in a shared data tree and a first node context map from a first agent, the first node context map comprising last known contexts of all the agents for the node according to knowledge of the first agent; determining, at the second agent, whether any of three conditions relating to the first node context map and a second node context map is true, the second node context map comprising last known contexts of all the agents for the node according to knowledge of the second agent; and in response to determining that none of the three conditions relating to the first node context map and the second node context map is true, updating, at the second agent, the node based on the data update message from the first agent.