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:
“The fact that behavior is “normal,” or consistent with childhood development, does not necessarily make it desirable or acceptable...Undesirable impulses do not have to be embraces as something good in order to be accepted as normal. Neither does children’s behavior that is unacceptable have to be condemned as “bad,” in order to bring it under control.”
—Elaine Heffner (20th century)