Efficient insertion algorithms for bucketized cuckoo hashing

Develop efficient insertion algorithms for bucketized cuckoo hashing in which each element hashes to two buckets of size \(b\).

Background

The paper distinguishes bucketized cuckoo hashing from the d-ary setting: each item has only two bucket choices, so repeated evictions can reuse randomness that has already influenced the table state. The authors identify this spoiled-randomness issue as a major obstacle to analyzing efficient insertion, leaving the development of such algorithms open.

References

In addition to these, another major open question is to develop efficient insertion algorithms for bucketized cuckoo hashing, where each element hashes to two buckets of size $b$ .

— Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up  (2501.02312 - Kuszmaul et al., 4 Jan 2025) in Section Conclusion