23 search results - page 1 / 5 » External perfect hashing for very large key sets |
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
We present a simple and efficient external perfect hashing scheme (referred to as EPH algorithm) for very large static key sets. We use a number of techniques from the literature ...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
SIGIR
1992
ACM
13 years 9 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
SOFSEM
2009
Springer
14 years 2 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
ICALP
1999
Springer
13 years 9 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...