Back to course home
0% completed
2. Consistent Hashing
Let's learn about Consistent Hashing and its usage.
Background
The act of distributing data across a set of nodes is called data partitioning. There are two challenges when we try to distribute data:
- How do we know on which node a particular piece of data will be stored?
- When we add or remove nodes, how do we know what data will be moved from existing nodes to the new nodes? Additionally, how can we minimize data movement when nodes join or leave?
A naive approach will use a suitable hash function that maps the data key to a number
.....
.....
.....
Like the course? Get enrolled and start learning!