Consistent Hashing
Visualize consistent hashing with virtual nodes for distributed caching and load balancing.
Free theory articleVisualize consistent hashing with virtual nodes for distributed caching and load balancing.
Concept & interpretation
Consistent hashing is a distributed hashing scheme that operates independently of the number of servers or objects in a distributed hash table. In traditional hash tables, changing the number of array slots causes nearly all keys to be remapped. Consistent hashing minimizes reorganization: when a hash table is resized, only k/n keys need to be remapped on average, where k is the number of keys and n is the number of slots or servers.