Construct · 1 fields · 1 citations

consistent hashing: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Distributed systems

hashing keys and servers onto the same circle so adding or removing a server moves only a small share of keys.

In distributed systems, consistent hashing refers to hashing keys and servers onto the same circle so adding or removing a server moves only a small share of keys. This meaning comes from Karger (1997) in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how consistent hashing sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

server1 fields · 1 citationsanchor · a standalone construct share2 fields · 2 citationsjingle · one word, two constructs

References

Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., & Lewin, D. (1997). Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97. https://doi.org/10.1145/258533.258660

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct