Two hybrid methods for collision resolution in open addressing hashing

  • Walter Cunto
  • Patricio V. Poblete
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 318)


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.


Hybrid Method Mixed Strategy Basic Strategy Hash Table Probe Position 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amble, O. and Knuth, D.E., “Ordered Hash Tables,” The Computer Journal 17, 2 (May 1974), 135–147.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Char, B.W., Geddes, K.O., Gonnet, G.H., and Watt, S.M., Maple User's Guide, Watcom Publications Limited, Waterloo, Ontario (1985).Google Scholar
  4. 4.
    Gonnet, G., Handbook of Algorithms and Data Structures, Addison-Wesley Publishing Company, London, 1984.Google Scholar
  5. 5.
    Knuth, D.E., The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, 1973.Google Scholar
  6. 6.
    Poblete, P.V. and Munro, J.I., “Last-Come-First-Served Hashing,” to appear in Journal of Algorithms.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Walter Cunto
    • 1
  • Patricio V. Poblete
    • 2
  1. 1.Centro Cientifico IBM de VenezuelaCaracasVenezuela
  2. 2.Departmento Ciencias de la ComputacionUniversidad de ChileSantiagoChile

Personalised recommendations