Grokking the System Design Interview, Volume II
Vote

0% completed

​

20. Merkle Trees

Comparing two large replicas byte by byte wastes bandwidth. A Merkle tree finds exactly where they differ without moving most of the data.

Background

The previous lesson showed how read repair removes conflicts while serving a read. But if a replica is far out of date, resolving its conflicts that way can take a long time. It would help to resolve some conflicts automatically, in the background, instead.

To do that, we need to compare two copies of a range of data and find exactly which parts differ

.....

.....

.....

Like the course? Get enrolled and start learning!

Reading Progress

0%

Vote for new content