Part 1 of 8 · 1 min read
Why this page comes third in Level 10
In this module you will
- State the scope of a key-value store and estimate how many nodes it needs.
- Explain why one server is not enough and what the CAP trade-off means for the choice.
- Place keys with consistent hashing, copy them to N nodes, and tune N, W and R.
- Detect conflicting versions with vector clocks.
- Describe how failures are found and repaired, and trace a write and a read through one node.
A key-value store pulls together almost everything from Levels 4 and 5: partitioning, replication, quorums, versions and failure handling. It is the best single page to show that the earlier ideas fit together. The book used is "System Design Interview" by Alex Xu, chapter 6, which draws on the Dynamo, Cassandra and Bigtable systems. The numbers marked "made up" only show the idea.