The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Note on the Efficiency of Hashing Functions
Journal of the ACM (JACM)
External hashing with limited internal storage
Journal of the ACM (JACM)
More analysis of double hashing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The cost distribution of clustering in random probing
Journal of the ACM (JACM)
The analysis of closed hashing under limited randomness
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Space Efficient Hash Tables with Worst Case Constant Access Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Lock-Gain Based Graph Partitioning
Journal of Heuristics
Information Sciences: an International Journal
Theoretical Computer Science
| Hi-index | 0.01 |
It was conjectured by J. Ullman that uniform hashing is optimal in its expected retrieval cost among all open-address hashing schemes [4]. In this paper, we show that, for any open-address hashing scheme, the expected cost of retrieving a record from a large table that is &agr;-fraction full is at least (1/&agr;) log (1/(1 - &agr;)) + o(1). This proves Ullman's conjecture to be true in the asymptotic sense.