问题描述
我正在阅读有关维修的在Cassandra中，它表示
I'm reading an document about repair in Cassandra, it says
但是，默克尔树的非叶子节点表示：
However, Merkle tree's non-leaf nodes represents:
据此，以及我发现的其他数据结构文章，它们都表明，只有在两棵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:
许多最终使用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中的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！