A hashing technique that maps both data and servers onto a single ring of hash values, so that adding or removing a server only reassigns the small share of data adjacent to it on the ring instead of remapping everything; widely used to distribute load in caches and distributed databases.
Facts
Core PrincipleEach BLOB is then assigned to the next server that appears on the circle in clockwise order. 1 Connections
In Field
Invented
David Karger co-authored the 1997 paper introducing consistent hashing for distributed caching.
Sources
1. Consistent hashing - Wikipedia
History section
This academic paper from 1997 in Symposium on Theory of Computing introduced the term 'consistent hashing' as a way of distributing requests among a changing population of web servers.
Basic technique section
Each BLOB is then assigned to the next server that appears on the circle in clockwise order.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.