Construct · 1 fields · 1 citations

cuckoo 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.

Algorithms and data structures

a hash table scheme in which each key has two possible locations and an insertion evicts and relocates occupants, giving worst-case constant lookup time.

In algorithms and data structures, cuckoo hashing refers to a hash table scheme in which each key has two possible locations and an insertion evicts and relocates occupants, giving worst-case constant lookup time. This meaning comes from Pagh (2004) in Journal of Algorithms.[1]

Unit
Recovery means
Measured by

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

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

constant2 fields · 2 citationsjingle · one word, two constructs hash2 fields · 3 citationsjingle · one word, two constructs

References

Pagh, R., & Rodler, F. F. (2004). Cuckoo hashing. Journal of Algorithms, 51(2), 122-144. https://doi.org/10.1016/j.jalgor.2003.12.002

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