A cuckoo hashing variant with improved memory utilization and insertion time
Ely Porat, Bar Shalem

TL;DR
This paper introduces a novel cuckoo hashing variant that aligns bucket placement with memory pages, significantly improving memory utilization and reducing insertion time through empirical evaluation and theoretical analysis.
Contribution
The paper proposes a cuckoo hashing scheme where buckets are contained within single memory pages, enhancing memory efficiency and insertion speed over existing variants.
Findings
Memory utilization increased to 97.46% with the new variant.
Insertion iterations reduced from 545 to 52 on average.
Theoretical lower bound on memory utilization provided.
Abstract
Cuckoo hashing [4] is a multiple choice hashing scheme in which each item can be placed in multiple locations, and collisions are resolved by moving items to their alternative locations. In the classical implementation of two-way cuckoo hashing, the memory is partitioned into contiguous disjoint fixed-size buckets. Each item is hashed to two buckets, and may be stored in any of the positions within those buckets. Ref. [2] analyzed a variation in which the buckets are contiguous and overlap. However, many systems retrieve data from secondary storage in same-size blocks called pages. Fetching a page is a relatively expensive process; but once a page is fetched, its contents can be accessed orders of magnitude faster. We utilize this property of memory retrieval, presenting a variant of cuckoo hashing incorporating the following constraint: each bucket must be fully contained in a single…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Advanced Image and Video Retrieval Techniques · Caching and Content Delivery
