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:
“Can a free people restrain crime without sacrificing fundamental liberties and a heritage of compassion?... Let us show that we can temper together those opposite elements of liberty and restraint into one consistent whole. Let us set an example for the world of a law-abiding America glorying in its freedom as well as its respect for law.”
—Gerald R. Ford (b. 1913)