Abstract
A hash structure, Overflow Indexing (OVI), using an index for the overflows is presented. The index contains one entry (key, bucket number) for each overflow. Formulas for computing the expected number of entries in the index and the standard deviation are derived and the numerical results obtained using these formulae are presented in a graph. It is concluded that storing the index in the main memory when operating on the file is feasible for small to medium-sized, and sometimes even large files. The number of probes for both a successful and unsuccessful search is one. Deletion requires two probes and insertion two or three probes. Details of OVI are presented and illustrated by simulation experiments. The structure of the index is discussed and one possible structure, hashing with dynamic buckets, is presented.
Similar content being viewed by others
References
D. S. Batory,Optimal file designs and reorganization points, ACM Trans. Database Syst. 7, 1 (March 1982), 60–81.
A. T. Berztiss,Data Structures, Theory and Practice, Academic Press, New York, 1975.
R. Fagin, J. Nievergelt, N. Pippenger and H. R. Strong,Extendible hashing — a fast access method for dynamic files, ACM Trans. Database Syst. 4, 3 (Sept. 1979), 315–344.
N. I. Johnson and S. Kotz,Discrete Distributions, Houghton Mifflin, Boston, 1969.
P. Å. Larson,Dynamic hashing, BIT, 18, 2 (1978), 184–201.
V. Y. Lum, P. S. T. Yuen and M. Dodd,Key-to-address transform techniques: a fundamental performance study on largé existing formatted files, Comm. ACM 14, 4 (April 1971), 228–239.
J. A. van der Pool,Optimal storage allocation for initial loading of a file, IBM J. Res. Develop. 16 (1972), 579–586.
B. Schneiderman,Optimum data base reorganization points, Comm. ACM, 16, 6 (June 1973), 362–365.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Törn, A.A. Hashing with Overflow Indexing. BIT 24, 317–332 (1984). https://doi.org/10.1007/BF02136030
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02136030