Abstract
Two simple methods for collision resolution in open addressing hashing are First-Come-First-Served (FCFS) and Last-Come-First-Served (LCFS). We introduce and analyze two hybrid methods, that generalize these basic strategies. The first one uses a probabilistic approach, and the second one uses a “two-phase” strategy, that can be tuned to achieve better performance than FCFS and LCFS.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Amble, O. and Knuth, D.E., “Ordered Hash Tables,” The Computer Journal 17, 2 (May 1974), 135–147.
Celis, P., Larson, P.-A., and Munro, J.L., “Robin Hood Hashing,” in Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science (Oct. 1985), 281–288.
Char, B.W., Geddes, K.O., Gonnet, G.H., and Watt, S.M., Maple User's Guide, Watcom Publications Limited, Waterloo, Ontario (1985).
Gonnet, G., Handbook of Algorithms and Data Structures, Addison-Wesley Publishing Company, London, 1984.
Knuth, D.E., The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, 1973.
Poblete, P.V. and Munro, J.I., “Last-Come-First-Served Hashing,” to appear in Journal of Algorithms.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cunto, W., Poblete, P.V. (1988). Two hybrid methods for collision resolution in open addressing hashing. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_12
Download citation
DOI: https://doi.org/10.1007/3-540-19487-8_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19487-3
Online ISBN: 978-3-540-39288-0
eBook Packages: Springer Book Archive