Consistent hashing is a special kind of hashing. 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.
Read more about Consistent Hashing: History, Need For Consistent Hashing, Technique, Monotonic Keys, Properties
Famous quotes containing the word consistent:
“De Sade is the one completely consistent and thoroughgoing revolutionary of history.”
—Aldous Huxley (1894–1963)