Merkle树用于差异比较，在Cassandra中 [英] Merkle tree for difference comparison, in Cassandra

问题描述

我正在阅读有关维修的文档在Cassandra中，它表示

I'm reading an document about repair in Cassandra, it says

比较从Merkle树的顶部节点开始。如果检测到没有差异，则该过程进行到左子节点并进行比较，然后是右子节点。

The comparison begins with the top node of the Merkle tree. If no difference is detected, the process proceeds to the left child node and compares and then the right child node.

但是，默克尔树的非叶子节点表示：

However, Merkle tree's non-leaf nodes represents:

树中较高的每个父节点是其各自子级的哈希。由于Merkle树中的较高节点表示树中的数据，Casandra可以独立检查每个分支，而无需协调器节点下载整个数据集。

Each Parent node higher in the tree is a hash of its respective children. Because higher nodes in the Merkle tree represent data further down the tree, Casandra can check each branch independently without requiring the coordinator node to download the entire data set.

据此，以及我发现的其他数据结构文章，它们都表明，只有在两棵Merkle树具有不同的根的情况下，才进行以下比根深的比较。我不确定文档是否正确描述了我可能理解有些问题，或者实际上有错误？

According to this, and other data structure articles I have found, they all indicates a following comparison deeper than the root only be proceed if two Merkle trees has the root that differs. I'm not sure if the document describes it correctly that I may understood something wrong, or it actually has an error?

推荐答案

Datastax文档中有一个错误。

There is a mistake in Datastax docs.

对Merkle树的比较有很好的解释：

There's is a good explanation of Merkle tree's comparison:

http://distributeddatastore.blogspot.co.il /2013/07/cassandra-using-merkle-trees-to-detect.html

许多最终使用Merkle树进行反熵的一致性数据库。您可以在Riak / DynamoDB文档中查看该文档及其解释。

Many eventual consistency databases using Merkle tree for anti-entropy. You can review the documentation and explanation of it in Riak/DynamoDB documentation.

这篇关于Merkle树用于差异比较，在Cassandra中的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！