Skip to Main content Skip to Navigation
Conference papers

Distributional analysis of Robin Hood linear probing hashing with buckets

Abstract : This paper presents the first distributional analysis of a linear probing hashing scheme with buckets of size $b$. The exact distribution of the cost of successful searches for a $b \alpha$ -full table is obtained, and moments and asymptotic results are derived. With the use of the Poisson transform distributional results are also obtained for tables of size $m$ and $n$ elements. A key element in the analysis is the use of a new family of numbers that satisfies a recurrence resembling that of the Bernoulli numbers. These numbers may prove helpful in studying recurrences involving truncated generating functions, as well as in other problems related with buckets.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184221
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 13, 2015 - 1:35:02 PM
Last modification on : Saturday, February 15, 2020 - 1:56:48 AM
Long-term archiving on: : Saturday, November 14, 2015 - 10:24:21 AM

File

dmAD0127.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184221, version 1

Citation

Alfredo Viola. Distributional analysis of Robin Hood linear probing hashing with buckets. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.297-306. ⟨hal-01184221⟩

Share

Metrics

Record views

225

Files downloads

686