z-logo
open-access-imgOpen Access
Fast and scalable minimal perfect hashing for massive key sets
Author(s) -
Antoine Limasset,
Guillaume Rizk,
Rayan Chikhi,
Pierre Peterlongo
Publication year - 2017
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - computer science , scalability , dynamic perfect hashing , hash function , key (lock) , hash table , consistent hashing , universal hashing , perfect hash function , theoretical computer science , parallel computing , distributed computing , programming language , double hashing , database , computer security

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom