TL;DR
This paper introduces a new multi-threaded and external-memory construction algorithm for PTHash, a minimal perfect hash function, enabling faster, scalable, and space-efficient hashing for large datasets with improved lookup performance.
Contribution
The paper presents a novel construction algorithm for PTHash that supports multi-threading and external-memory processing, enhancing scalability and efficiency over existing methods.
Findings
PTHash construction is faster and more space-efficient.
Lookup times are 2-6 times better than competing methods.
Scales to datasets much larger than internal memory.
Abstract
A function is a minimal perfect hash function for a set of size , if bijectively maps into the first natural numbers. These functions are important for many practical applications in computing, such as search engines, computer networks, and databases. Several algorithms have been proposed to build minimal perfect hash functions that: scale well to large sets, retain fast evaluation time, and take very little space, e.g., 2 - 3 bits/key. PTHash is one such algorithm, achieving very fast evaluation in compressed space, typically several times faster than other techniques. In this work, we propose a new construction algorithm for PTHash enabling: (1) multi-threading, to either build functions more quickly or more space-efficiently, and (2) external-memory processing to scale to inputs much larger than the available internal…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
