CentralNotice Consistent hashing From Wikipedia, the free encyclopedia Jump to: navigation , search Consistent hashing is a special kind of hashing such that when a hash table is resized and consistent hashing is used, only keys need to be remapped on average, where is the number of keys, and 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 achieves the same goals as Rendezvous hashing (also called HRW Hashing). The two techniques use different algorithms, and were devised independently and contemporaneously. 1 History 2 Need for consistent hashing 3 Technique 4 Monotonic keys 5 Properties 6 Examples of use 7 References 8 External links History [ edit ] Originally devised by Karger et al. at MIT for use in distributed caching, the idea h...