Sciweavers

Share
29 search results - page 1 / 6
» A sequence approach to linear perfect hash families
Sort
View
DCC
2007
IEEE
9 years 3 months ago
A sequence approach to linear perfect hash families
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...
Susan G. Barwick, Wen-Ai Jackson
WG
1993
Springer
8 years 8 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
ICONIP
1998
8 years 5 months ago
An Application of ELISA to Perfect Hashing with Deterministic Ordering
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
Monica Bianchini, Stefano Fanelli, Marco Gori
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
8 years 5 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
SSD
2001
Springer
162views Database» more  SSD 2001»
8 years 8 months ago
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
books