2005
DOI: 10.1145/1103963.1103965
|View full text |Cite
|
Sign up to set email alerts
|

Exact distribution of individual displacements in linear probing hashing

Abstract: This paper studies the distribution of individual displacements for the standard and the Robin Hood linear probing hashing algorithms. When the a table of size m has n elements, the distribution of the search cost of a random element is studied for both algorithms. Specifically, exact distributions for fixed m and n are found as well as when the table is α-full, and α strictly smaller than 1. Moreover, for full tables, limit laws for both algorithms are derived.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
18
1

Year Published

2005
2005
2017
2017

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 22 publications
(21 citation statements)
references
References 28 publications
2
18
1
Order By: Relevance
“…In this case, many of our results reduce to known results, see e.g. [22,42] and the references given there.…”
Section: Some Previous Workcontrasting
confidence: 56%
See 2 more Smart Citations
“…In this case, many of our results reduce to known results, see e.g. [22,42] and the references given there.…”
Section: Some Previous Workcontrasting
confidence: 56%
“…Moreover, in [22] and [42], a distributional analysis for the FCFS, LCFS and Robin Hood heuristic is presented. These results consider a hash table with buckets of size 1.…”
Section: Some Previous Workmentioning
confidence: 99%
See 1 more Smart Citation
“…I am also grateful to Alfredo Viola and Patricio Poblete for helpful discussions. Many related results, including some of the results below, have independently been found by Viola [29] by related but differently formulated methods. The reader is invited to compare (and combine) the two approaches.…”
Section: (T ) Is a Random Distribution And Its Mean E(d(t )|T ) And Vmentioning
confidence: 65%
“…Data storage in Homophony or Soundex search system is done by hash database the advantage of which is the focus on swift searching and adding/deleting member until static time O (1) but such data has to have no priority and duplicity [9,10]. This first step is to take word aimed to search for into the searching system G2P by following the process mentioned above and voice code from these words will be converted where ror-reua, lor-ling will be discarded by the system.…”
Section: Procedures For Homophony or Soundex Searchmentioning
confidence: 99%