73 search results - page 1 / 15 » Perfect Hashing for Data Management Applications |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
WWW
2007
ACM
14 years 5 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 ...
ALENEX
2009
13 years 5 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
SIGIR
1992
ACM
13 years 8 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...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
In this article we propose a new hashing framework for tree-structured data. Our method maps an unordered tree into a multiset of simple wedge-shaped structures refered to as pivot...