Distributional analysis of Robin Hood linear probing hashing with buckets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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.
Fichier principal
Vignette du fichier
dmAD0127.pdf (112.03 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184221 , version 1 (13-08-2015)

Identifiers

Cite

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, ⟨10.46298/dmtcs.3386⟩. ⟨hal-01184221⟩
116 View
607 Download

Altmetric

Share

Gmail Facebook X LinkedIn More