Fast and scalable minimal perfect hashing for
massive key sets
Antoine Limasset1, Guillaume Rizk1, Rayan Chikhi2, and Pierre
Peterlongo11 IRISA Inria Rennes Bretagne Atlantique, GenScale team, Campus de
Beaulieu 35042 Rennes, France2 CNRS, CRIStAL, Université de Lille, Inria Lille - Nord Europe, FranceAbstract
Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets.
Existing algorithms and implementations that build such functions have practical limitatio
