论文信息 - On Optimal Arrangements of Keys with Double Hashing

On Optimal Arrangements of Keys with Double Hashing

Given a set of n keys, the keys are arranged in a hash table of size n such that the worst-case retrieval time is minimized. It is shown that, when double hashing is used, one can, with probability 1 − o(1), arrange the keys to achieve a worst-case retrieval time O(log n). This gives a solution to an open problem in Rivest (J. Assoc. Comput. Mach. 25 (1978), 200–209).

Andrew Chi-Chih Yao

[1] Gaston H. Gonnet,et al. Efficient Ordering of Hash Tables , 1979, SIAM J. Comput..

[2] Alfréd Rényi,et al. Foundations of Probability , 1971 .

[3] P. Hall. On Representatives of Subsets , 1935 .

[4] G. V. Balakin. On Random Matrices , 1967 .

[5] Ronald L. Rivest. Optimal Arrangement of Keys in a Hash Table , 1978, JACM.

[6] Leonidas J. Guibas,et al. The Analysis of Double Hashing , 1978, J. Comput. Syst. Sci..

[7] Theodore Hailperin. Foundations of Probability in Mathematical Logic , 1937, Philosophy of Science.