educative.io

How consistent hashing solve the overloaded partition issue in hashing based partitioning?

It is mentioned that if the hashing based partitioning results in overloaded partition, consistent hashing can solve the problem ? Can somebody explain how ?

1 Like

Hi @Sumit_Sonkhla, Thank you for contacting the Educative team with your query!
Consistent hashing is used in distributed systems to keep the hash table independent of the number of servers available to minimize key relocation when changes of scale occur.
Consistent Hashing stores the data managed by a distributed system in a ring. Each node in the ring is assigned a range of data.
The link of Consistent hashing is added where you can see the detail working and concept of consistent hashing. Consistent Hashing

Please feel free to reply here if there is still some confusion.

Hope you have an amazing learning experience on Educative!