Article

Free access

On aspects of university and performance for closed hashing

Authors:

J. P. Schmidt,

A. SiegelAuthors Info & Claims

STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing

Pages 355 - 366

https://doi.org/10.1145/73007.73041

Published: 01 February 1989 Publication History

PDF eReader

Abstract

We consider two hashing models for storing a set S ⊂ {0, 1, 2, …, m - 1} in a table T of size n.

The first model uses universal hashing for a partially loaded table. A set of hash functions is universal if, for any the input set, a randomly selected function has an efficient expected performance. Universal hash functions originate in [CW79], where they were used for open hashing using chaining. [CW79] poses as an open question whether comparable results can be achieved for any closed hashing schemes.

The second model is perfect hashing for a full table. In preprocessing the input set is used to determine a hash function that achieves some desired performance criteria. This model was used among others in [ME82] and [FKS84].

In both models a key problem is to construct a “small” set of functions, which will permit a short description (program) for each function in the set.

We show, for the first time, that universal hashing can be successfully used for closed hashing and in particular for double hashing. Specifically, the set of congruential polynomials of Ο(log n) degree is universal for double hashing if the table load is below .75; the program size (or number of random bits generated by the algorithm) is Ο(log log m + log² n).

For perfect hashing, we obtain nearly tight results on the size of oblivious Ο(1)-probe hash functions:

Oblivious k-probe hash functions require Ω(n/k²e^-k + log log m) bits of description.

A probabilistic construction is presented, which shows that oblivious k-probe hash functions, can be specified in Ο(ne^-k + log log m) bits, which nearly matches the above lower bound.

We give a variation of an Ο(1) time 1-probe (perfect) hash function that can be specified in Ο(n + log log m) bits, which is tight to within a constant factor of the lower bound.

In view of the adaptive schemes presented in [FNSS88], these bounds establish a significant gap between oblivious and non-oblivious Ο(1)-probe search.

References

[1]

M. Ajtai. "A Lower Bound for Finding Predecessors in Yao's Cell Probe Model," IBM RJ 4867 (51297) 10/3/85, Computer Science.

Abstract

References

Cited By

Index Terms

Recommendations

Dynamic perfect hashing: upper and lower bounds

Contention Resolution in Hashing Based Shared Memory Simulations

Performance comparison of extendible hashing and linear hashing techniques

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations