Fast and scalable minimal perfect hashing for massive key sets - Archive ouverte HAL Access content directly
Conference Papers Year :

Fast and scalable minimal perfect hashing for massive key sets

(1) , (1) , (2) , (1)
1
2

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
Fichier principal
Vignette du fichier
p11-limasset.pdf (681.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01566246 , version 1 (20-07-2017)

Identifiers

Cite

Antoine Limasset, Guillaume Rizk, Rayan Chikhi, Pierre Peterlongo. Fast and scalable minimal perfect hashing for massive key sets. 16th International Symposium on Experimental Algorithms, Jun 2017, London, United Kingdom. pp.1 - 11. ⟨hal-01566246⟩
789 View
778 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More