Sciweavers

21 search results - page 3 / 5
» Cuckoo Hashing
Sort
View
ESA
2001
Springer
85views Algorithms» more  ESA 2001»
13 years 9 months ago
Cuckoo Hashing
Rasmus Pagh, Flemming Friche Rodler
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 5 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
SBBD
2008
256views Database» more  SBBD 2008»
13 years 6 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
DAMON
2006
Springer
13 years 9 months ago
Architecture-conscious hashing
Hashing is one of the fundamental techniques used to implement query processing operators such as grouping, aggregation and join. This paper studies the interaction between modern...
Marcin Zukowski, Sándor Héman, Peter...