Fast And Scalable Minimal Perfect Hashing For Massive Key Sets

Limasset Antoine, Rizk Guillaume, Chikhi Rayan, Peterlongo Pierre. Arxiv 2017

[Paper] [Code]    
ARXIV Has Code Independent

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

Similar Work

• Recsplit Minimal Perfect Hashing Via Recursive Splitting
• Perfect Hashing For Data Management Applications
• Pthash Revisiting FCH Minimal Perfect Hashing
• Parallel And External-memory Construction Of Minimal Perfect Hash Functions With Pthash