Fast and scalable minimal perfect hashing for massive key sets

Antoine Limasset; Guillaume Rizk; Pierre Peterlongo; Rayan Chikhi

arxiv: 1702.03154 · v2 · pith:MSKVOQJHnew · submitted 2017-02-10 · 💻 cs.DS

Fast and scalable minimal perfect hashing for massive key sets

Antoine Limasset , Guillaume Rizk , Rayan Chikhi , Pierre Peterlongo This is my paper

classification 💻 cs.DS

keywords memoryminimalperfectbbhashconstructionelementsfunctionfunctions

0 comments

read the original abstract

Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical limitations on the number of input elements they can process, due to high construction time, RAM or external memory usage. We revisit a simple algorithm and show that it is highly competitive with the state of the art, especially in terms of construction time and memory usage. We provide a parallel C++ implementation called BBhash. It is capable of creating a minimal perfect hash function of $10^{10}$ elements in less than 7 minutes using 8 threads and 5 GB of memory, and the resulting function uses 3.7 bits/element. To the best of our knowledge, this is also the first implementation that has been successfully tested on an input of cardinality $10^{12}$. Source code: https://github.com/rizkg/BBHash

This paper has not been read by Pith yet.

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA
cs.AR 2025-12 conditional novelty 7.0

HyperX is the first end-to-end FPGA accelerator for Nyström-based HDC graph classification, delivering 6.85× speedup and 169× energy efficiency over CPU baselines plus 3.4% average accuracy gain on TUDataset benchmarks.