Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1996: Algorithms — ESA '96 pp 221–233Cite as

The analysis of linear probing hashing with buckets

Extended abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1136))

Abstract

We present the first exact analysis of a linear probing hashing scheme with buckets of size b. From the generating function for the Robin Hood heuristic we obtain exact expressions for the cost of successful searches. For a full table, with the help of Singularity Analysis, we find the asymptotic expansion of this cost up to O((bm)−1). We conclude with a new approach to study certain recurrences that involve truncated exponentials. A new family of numbers that satisfies a recurrence resembling that of the Bernoulli numbers is introduced. These numbers may prove helpful in studying recurrences involving truncated generating functions.

This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under grant No. A8237, the Information Technology Research Centre of Ontario, and FONDECYT(Chile) under grants 1940271 and 1960881. This work was done while the first author was at the University of Waterloo.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I.F. Blake and A.G. Konheim. Big buckets are (are not) better! J. ACM, 24(4):591–606, October 1977.

    Google Scholar 

  2. B.W.Char, K.O.Geddes, G.H.Gonnet, B.L.Leong, M.B.Monagan, and S.M.Watt. MAPLE V Reference Manual. Springer-Verlag, 1991.

    Google Scholar 

  3. S. Carlsson, J.I. Munro, and P.V. Poblete. On linear probing hashing. Unpublished Manuscript.

    Google Scholar 

  4. P. Celis. Robin Hood Hashing. PhD thesis, Computer Science Department, University of Waterloo, April 1986. Technical Report CS-86-14.

    Google Scholar 

  5. P. Celis, P.-Å. Larson, and J.I. Munro. Robin hood hashing. In 26th IEEE Sympusium on the Foundations of Computer Science, pages 281–288, 1985.

    Google Scholar 

  6. P. Flajolet and A. M. Odlyzko. Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics, 3(2):216–240, 1990.

    Article  Google Scholar 

  7. P. Flajolet, M Régnier, and R. Sedgewick. Some uses of the mellin integral transform in the analysis of algorithm. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO Advance Science Institute Series. Series F: Computer and System Sciences, pages 241–254. Springer Verlag, 1985. (invited lecture).

    Google Scholar 

  8. P. Flajolet and R. Sedgewick. The average case analysis of algorithms: Complex asymptotics and generating functions. Research Report 2026, INRIA, Sept 1993.

    Google Scholar 

  9. G.H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, 1991. Second Edition.

    Google Scholar 

  10. G.H. Gonnet and J.I. Munro. The analysis of linear probing sort by the use of a new mathematical transform. Journal of Algorithms, 5:451–470, 1984.

    Google Scholar 

  11. R.L. Graham, D.E. Knuth, and O.Patashnik. Concrete Mathematics. Addison-Wesley Publishing Company, 1989.

    Google Scholar 

  12. P. Jacquet and M Régnier. Trie partitioning process: Limiting distributions. In A. Apostolico and Z. Galil, editors, Proceedings of the 11th Colloquim on Trees in Algebra and Programming (CAAP), volume 214 of Lecture Notes in Computer Science, pages 196–210. Springer Verlag, March 1986.

    Google Scholar 

  13. D.E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley Publishing Company, 1973.

    Google Scholar 

  14. A.G. Konheim and B. Weiss. An occupancy discipline and applications. SIAM Journal on Applied Mathematics, 6(14):1266–1274, 1966.

    Google Scholar 

  15. H. Mendelson. Analysis of linear probing with buckets. Information Systems, 8(3):207–216, 1983.

    Google Scholar 

  16. H. Mendelson and U. Yechiali. A new approach to the analysis of linear probing schemes. J. ACM, 27:474–483, 1980.

    Google Scholar 

  17. W.W. Peterson. Addressing for random-access storage. IBM Journal of Research and Development, 1(2):130–146, 1957.

    Google Scholar 

  18. R. Sedgewick. Mathematical analysis of combinatorial algorithms. In G. Louchard and G. Latouche, editors, Probability Theory and Computer Science, pages 123–205. Academic Press, Inc., 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute de Computacion, Universidad de la República, Casilla de Correo, 16120, Montevideo, Uruguay

    Alfredo Viola

  2. Department of Computer Science, University of Chile, Casilla, 2777, Santiago, Chile

    Patricio V. Poblete

Authors
  1. Alfredo Viola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patricio V. Poblete
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz Maria Serna

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Viola, A., Poblete, P.V. (1996). The analysis of linear probing hashing with buckets. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-61680-2_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61680-1

  • Online ISBN: 978-3-540-70667-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation