Construct · 1 fields · 1 citations

rendezvous 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

a mapping scheme in which each key is assigned to the server with the highest hash score for that key-server pair, so few keys move when servers change.

In distributed systems, rendezvous hashing refers to a mapping scheme in which each key is assigned to the server with the highest hash score for that key-server pair, so few keys move when servers change. This meaning comes from Thaler (1998) in IEEE/ACM Transactions on Networking.[1]

Unit
Recovery means
Measured by

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

See how rendezvous 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

hash2 fields · 3 citationsjingle · one word, two constructs score2 fields · 3 citationsjingle · one word, two constructs server1 fields · 1 citationsanchor · a standalone construct

References

Thaler, D. G., & Ravishankar, C. V. (1998). Using name-based mappings to increase hit rates. IEEE/ACM Transactions on Networking, 6(1), 1-14. https://doi.org/10.1109/90.663936

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