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:
“We should be careful never to imagine, that the wedding-day is the burial of love, but that in reality love then begins its best life; and if we set out upon that principle, and are mindful to keep it up, and give due attention and aid to the progress of love thus brought into the well ordered well sheltered garden, we may enjoy I believe as much happiness as is consistent with the imperfection of our present state of being.”
—James Boswell (1740–1795)