Affiliation:
1. Uppsala University, Uppsala, Sweden
Abstract
We study the distribution of the individual displacements in hashing with linear probing for three different versions: First Come, Last Come and Robin Hood. Asymptotic distributions and their moments are found when the the size of the hash table tends to infinity with the proportion of occupied cells converging to some α, 0 < α < 1. (In the case of Last Come, the results are more complicated and less complete than in the other cases.)We also show, using the diagonal Poisson transform studied by Poblete, Viola and Munro, that exact expressions for finite
m
and
n
can be obtained from the limits as
m,n
→ ∞.We end with some results, conjectures and questions about the shape of the limit distributions. These have some relevance for computer applications.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference29 articles.
1. Billingsley P. 1968. Convergence of Probability Measures. Wiley New York. Billingsley P. 1968. Convergence of Probability Measures. Wiley New York.
2. Sur l'emploi du théorème de Bernoulli pour faciliter le calcul d'une infinité de coefficients. Application au problème de l'attente à un guichet;Borel;C. R. Acad. Sci. Paris,1942
3. Carlsson S. Munro J. I. and Poblete P. V. 1987. On linear probing hashing. Unpublished manuscript. Carlsson S. Munro J. I. and Poblete P. V. 1987. On linear probing hashing. Unpublished manuscript.
4. Phase transition for Parking blocks, Brownian excursion and coalescence
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献