Distributional analysis of Robin Hood linear probing hashing with buckets - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Distributional analysis of Robin Hood linear probing hashing with buckets

Résumé

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
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
119 Consultations
650 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More