Cryptography: Theory and Practice
Cryptography: Theory and Practice
Data Structures, Algorithms and Object Oriented Programming
Data Structures, Algorithms and Object Oriented Programming
Dynamical system representation of open address hash functions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Minimal perfect hashing: A competitive method for indexing internal memory
Information Sciences: an International Journal
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper an efficient open address hash function called exponential hashing is developed. The motivation for this hash function resulted from our ongoing efforts to apply dynamical systems theory to the study of hashing; however, the analysis conducted in this paper is primarily based on traditional number theory. Proofs of optimal table parameter choices are provided for a number of hash functions. We also demonstrate experimentally that exponential hashing essentially matches the performance of a widely-used optimal double hash function for uniform data distributions, and performs significantly better for nonuniform data distributions. We show that exponential hashing exhibits a higher integer Lyapunov exponent and entropy than double hashing for initial data probes, which offers one explanation for its improved performance on nonuniform data distributions.