Abstract.
This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models are considered, that of full tables and that of sparse tables with a fixed filling ratio strictly smaller than one. For full tables, the construction cost has expectation O(n 3/2 ) , the standard deviation is of the same order, and a limit law of the Airy type holds. (The Airy distribution is a semiclassical distribution that is defined in terms of the usual Airy functions or equivalently in terms of Bessel functions of indices \( -\frac{1}{3},\frac{2}{3} \) .) For sparse tables, the construction cost has expectation O(n) , standard deviation O ( \( \sqrt{n} \) ), and a limit law of the Gaussian type. Combinatorial relations with other problems leading to Airy phenomena (like graph connectivity, tree inversions, tree path length, or area under excursions) are also briefly discussed.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 5, 1997; revised January 15, 1998.
Rights and permissions
About this article
Cite this article
Flajolet, P., Poblete, P. & Viola, A. On the Analysis of Linear Probing Hashing . Algorithmica 22, 490–515 (1998). https://doi.org/10.1007/PL00009236
Issue Date:
DOI: https://doi.org/10.1007/PL00009236