A Unified Approach to Linear Probing Hashing with Buckets
- 181 Downloads
We give a unified analysis of linear probing hashing with a general bucket size. We use both a combinatorial approach, giving exact formulas for generating functions, and a probabilistic approach, giving simple derivations of asymptotic results. Both approaches complement nicely, and give a good insight in the relation between linear probing and random walks. A key methodological contribution, at the core of Analytic Combinatorics, is the use of the symbolic method (based on q-calculus) to directly derive the generating functions to analyze.
KeywordsHashing Linear probing Buckets Generating functions Analytic combinatorics
Mathematics Subject Classification60W40 68P10 68P20
Philippe Flajolet has had a strong influence in our scientific careers. The core of the use of the symbolic method in hashing problems has been taken from . Thank you Philippe for all the work you have left to inspire our research. We also thank Alois Panholzer for interesting discussions, Mark Wilson for comments on multivariate singularity analysis, and Hsien-Kuei Hwang for suggesting us the derivation that leads to Theorem 50. Last but not least, we thank an anonymous referee for useful comments oriented to improve the presentation of the paper.
- 5.Celis, P.: Robin Hood Hashing. PhD thesis, Computer Science Department, University of Waterloo. Technical Report CS-86-14, April (1986)Google Scholar
- 6.Celis, P., Larson, P., Munro, I.J.: Robin hood hashing. In: 26th IEEE Symposium on the Foundations of Computer Science, pp. 281–288 (1985)Google Scholar
- 10.Ernst, T.: The history of \(q\)-calculus and a new method, U. U. D. M. Report 2000:16, ISSN 1101-3591, Department of Mathematics, Uppsala University (2000)Google Scholar
- 13.Flajolet, P.: Slides of the lecture “On the Analysis of Linear Probing Hashing” (1998). http://algo.inria.fr/flajolet/Publications/lectures.html
- 18.Gonnet, G.H., Baeza-Yates, R.: Handbook of Algorithms and Data Structures, 2nd edn. Pascal and Addison-Wesley (1991)Google Scholar
- 26.Knuth, D.: Notes on “open” addressing. Unpublished memorandum, 1963. (Memo dated July 22, 1963. With annotation “My first analysis of an algorithm, originally done during Summer 1962 in Madison”. Also conjectures the asymptotics of the \(Q\)-function, with annotation “Proved May 24, 1965”.). http://algo.inria.fr/AofA/Research/11-97.html
- 33.Olver, F.W.J., Lozier, D.W., Boisvert, R.F., Clark, C.W.: NIST Handbook of Mathematical Functions. Cambridge University Press, Cambridge (2010). Also available as NIST Digital Library of Mathematical Functions. http://dlmf.nist.gov/
- 34.Panholzer, A.: Slides of the lecture “Asymptotic results for the number of unsuccessful parkers in a one-way street” (2009). http://info.tuwien.ac.at/panholzer/
- 40.Seitz, G.: Parking Functions and Generalizations. Diploma Thesis, TU Wien (2009)Google Scholar
- 41.Viola, A.: Analysis of Hashing Algorithms and a New Mathematical Transform. PhD thesis, Computer Science Department, University of Waterloo. Technical Report CS-95-50 (November 1995)Google Scholar