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.
Keywords :
Type de document :
Communication dans un congrès
Conrado Martìnez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.297-306, 2005, DMTCS Proceedings
Domaine :

Littérature citée [25 références]

https://hal.inria.fr/hal-01184221
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 13 août 2015 - 13:35:02
Dernière modification le : jeudi 11 janvier 2018 - 06:17:32
Document(s) archivé(s) le : samedi 14 novembre 2015 - 10:24:21

Fichier

Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

• HAL Id : hal-01184221, version 1

Citation

Alfredo Viola. Distributional analysis of Robin Hood linear probing hashing with buckets. Conrado Martìnez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.297-306, 2005, DMTCS Proceedings. 〈hal-01184221〉

Métriques

Consultations de la notice

124

Téléchargements de fichiers