论文信息 - Split sequence coalesced hashing

Split sequence coalesced hashing

Abstract The purpose of the present paper is to propose two new variants of coalesced hashing scheme with the objective of minimizing the number of probes needed for successful and unsuccessful search. We also describe our experience with the detailed simulation experiments done with different versions of the proposed schemes.

Pradip K. Srimani | D. Murthy

[1] Jeffrey Scott Vitter,et al. Analysis of the Search Performance of Coalesced Hashing , 1983, JACM.

[2] Francis A. Williams. Handling identifies as internal symbols in language processors , 1959, CACM.

[3] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[4] Jeffrey Scott Vitter,et al. Analysis of Early-Insertion Standard Coalesced Hashing , 1983, SIAM J. Comput..

[5] M. Abramowitz,et al. Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[6] Jeffrey Scott Vitter,et al. Deletion algorithms for hashing that preserve randomness , 1982, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[7] Fabrizio Luccio,et al. Split Sequence Hash Search , 1985, Inf. Process. Lett..

[8] Jeffrey Scott Vitter. Implementations for coalesced hashing , 1982, CACM.

[9] Jeffrey Scott Vitter,et al. Analysis of new variants of coalesced hashing , 1984, TODS.