On the Analysis of Linear Probing Hashing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

On the Analysis of Linear Probing Hashing

Philippe Flajolet
  • Function : Author
  • PersonId : 829512
Patricio Poblete
  • Function : Author
Alfredo Viola
  • Function : Author

Abstract

This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash table under the linear probing strategy. Two models are considered, that of full tables and that of sparse tables with a filling ratio strictly smaller than~1. 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 semi-classical 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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3265.pdf (490.51 Ko) Télécharger le fichier

Dates and versions

inria-00073424 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073424 , version 1

Cite

Philippe Flajolet, Patricio Poblete, Alfredo Viola. On the Analysis of Linear Probing Hashing. [Research Report] RR-3265, INRIA. 1997. ⟨inria-00073424⟩
162 View
348 Download

Share

Gmail Facebook X LinkedIn More