How does consistent hashing fix that?
Both nodes and keys map to positions on a circle. A key belongs to the next node encountered walking clockwise. When you add a node, it lands on the circle between two existing nodes. Only keys in that arc rebalance. The other arcs stay pointing to the same node.
Answered in
When 87% of Your Cache VanishesConsistent hashing maps nodes and keys to a circle, so adding a server moves only 1/N of keys instead of almost all of them.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.