Jump to content

Consistent hashing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nethgirb (talk | contribs) at 01:02, 12 August 2005 (Basic definition, no description of how it works though, just a stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Stub icon

This computer networking article is a stub. You can help Wikipedia by expanding it.


Consistent hashing is a scheme that provides hash table functionality in a way that the addition or removal of one bucket does not significantly change the mapping of keys to buckets. In contrast, in most traditional hash tables, a change in the number of buckets causes nearly all keys to be remapped.

Consistent hashing was introduced in 1997, largely in the context of distributing requests among many web servers. More recently, it and similar techniques have been employed in distributed hash tables.

References

Retrieved from "https://en.wikipedia.org/w/index.php?title=Consistent_hashing&oldid=20818023"