Consistent Hashing, a process discovered by Karger et al. at MIT, is a special kind of hashing such that when a hash table is resized only K/n keys need to be remapped unlike normal hashing techniques
Definition
Consistent hashing is a special kind of hashing such that when a hash table is resized and consistent hashing is used, only
K/n
keys need to be remapped on average, whereK
is the number of keys, andn
is the number of slots. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped.
Consistent hashing is used in many places. The most famous being OpenStack's Object Storage component called as Cinder
Source