Analysis of information sources in references of the Wikipedia article "Merkle tree" in English language version.
Last modified:
When a replica is down for an extended period of time, or the machine storing hinted handoffs for an unavailable replica goes down as well, replicas must synchronize from one another. In this case, Cassandra and Riak implement a Dynamo-inspired process called anti-entropy. In anti-entropy, replicas exchange Merkle trees to identify parts of their replicated key ranges which are out of sync. A Merkle tree is a hierarchical hash verification: if the hash over the entire keyspace is not the same between two replicas, they will exchange hashes of smaller and smaller portions of the replicated keyspace until the out-of-sync keys are identified. This approach reduces unnecessary data transfer between replicas which contain mostly similar data.
{{cite journal}}: Cite uses deprecated parameter |citeseerx= (help){{cite book}}: CS1 maint: location missing publisher (link){{cite journal}}: Cite uses deprecated parameter |citeseerx= (help){{cite journal}}: Cite uses deprecated parameter |citeseerx= (help){{cite book}}: CS1 maint: location missing publisher (link)