← 返回卡片

原书出处

System Design Interview – An insiders guide, Second Edition

06 键值存储

Second Edition · 核验版本的摘录快照 · 导入于 2026-10-23T11:57:02.180Z

To compare two Merkle trees, start by comparing the root hashes. If root hashes match, both servers have the same data. If root hashes disagree, then the left child hashes are compared followed by right child hashes. You can traverse the tree to find which buckets are not synchronized and synchronize those buckets only. Using Merkle trees, the amount of data needed to be synchronized

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0016.html

EPUB SHA-256:ffc3a97753094acb30719f26589af322724b6c17c10371f0626e61687734b345