Construct · 1 fields · 1 citations

distributed hash table: 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 decentralized key-value lookup service in which peers route queries to the node responsible for a key in a logarithmic number of hops.

In distributed systems, distributed hash table refers to a decentralized key-value lookup service in which peers route queries to the node responsible for a key in a logarithmic number of hops. This meaning comes from Stoica (2003) 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 distributed hash table 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 Kademlia1 fields · 1 citationsanchor · a standalone construct node2 fields · 4 citationsjingle · one word, two constructs

References

Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003). Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11(1), 17-32. https://doi.org/10.1109/tnet.2002.808407

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