Fast and scalable minimal perfect hashing for massive key sets.

Antoine Limasset Guillaume Rizk Rayan Chikhi Pierre Peterlongo

Published in: CoRR (2017)

Keyphrases

minimal subsets
hash functions
databases
neural network
data streams
similarity search
massive data
real time
data structure
lightweight
convex sets
nearest neighbor search
set theoretic
hashing algorithm