论文信息 - Minimean optimal key arrangements in hash tables

Minimean optimal key arrangements in hash tables

For an open-addressing hash functionh and a setA ofn keys, letCh(A) be the expected retrieval cost when the keys are arranged to minimize the expected retrieval cost in a full table. It is shown that, asymptotically for largen, whenh satisfies a certain doubly dispersive property, as is the case for double hashing,Ch(A)=0(1) with probability 1 − 0(1) for a randomA.

Andrew Chi-Chih Yao

[1] Andrew Chi-Chih Yao. On Optimal Arrangements of Keys with Double Hashing , 1985, J. Algorithms.

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

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

[4] R. Karp. An Upper Bound on the Expected Cost of an Optimal Assignment , 1987 .

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

[6] David W. Walkup,et al. On the Expected Value of a Random Assignment Problem , 1979, SIAM J. Comput..

[7] Richard M. Karp,et al. A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..

[8] Richard P. Brent,et al. Reducing the retrieval time of scatter storage techniques , 1973, Commun. ACM.

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

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