What is consistent hashing?
Consistent hashing is a scheme that provides hash table functionality in a way that the addition or removal of one slot does not significantly change the mapping of keys to slots. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped. By using consistent hashing, only K/n keys need to be remapped on average, where K is the number of keys, and n is the number of slots.
http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment