System Design Visualized
Lesson 6.3

Data partition and replication

Play this lessonThis lesson comes with an interactive animation you can break and a chapter quiz.

Partitioning: the data is too big for one server, so split it. The two challenges, distributing data evenly and moving as little as possible when nodes change, are solved by consistent hashing (Chapter 5). Bonus benefits: automatic scaling (add or remove servers with little data movement) and heterogeneity (more powerful servers get more virtual nodes).

The rest of this lesson is part of Pro

Pro unlocks every lesson with its animation, code challenge and quiz, plus every interview problem. ₹299 a month or ₹1,999 a year.

See Pro

Remember it, then prove it

Create a free account to save your progress, get spaced-repetition reviews of what you miss, and design real systems in the interview simulator.

Start free