Exact distribution of individual displacements in linear probing hashing

@article{Viola2005ExactDO,
  title={Exact distribution of individual displacements in linear probing hashing},
  author={Alfredo Viola},
  journal={ACM Trans. Algorithms},
  year={2005},
  volume={1},
  pages={214-242}
}
  • Alfredo Viola
  • Published 1 October 2005
  • Mathematics
  • ACM Trans. Algorithms
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. 

Figures from this paper

Individual displacements for linear probing hashing with different insertion policies
TLDR
It is shown, using the diagonal Poisson transform studied by Poblete, Viola and Munro, that exact expressions for finite m and n can be obtained from the limits as m,n → ∞.
The Maximum Displacement for Linear Probing Hashing
  • N. Petersson
  • Mathematics
    Combinatorics, Probability and Computing
  • 2013
TLDR
The maximum displacement for linear probing hashing is studied using the standard probabilistic model together with the insertion policy known as First-Come-(First-Served), which focuses on dense hash tables.
Distributional analysis of Robin Hood linear probing hashing with buckets
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α -full table is
Distributional analysis of Robin Hood linear probing hashing with buckets
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α-full table is
Distributional Analysis of the Parking Problem and Robin Hood Linear Probing Hashing with Buckets
TLDR
This paper presents the first distributional analysis of both, a parking problem and a linear probing hashing scheme with buckets of size b, and uses a new family of numbers, called Tuba Numbers, that satisfies a recurrence resembling that of the Bernoulli numbers.
A Unified Approach to Linear Probing Hashing with Buckets
TLDR
A unified analysis of linear probing hashing with a general bucket size is given, using the symbolic method (based on q-calculus) to directly derive the generating functions to analyze.
Individual Displacements in Hashing with Coalesced Chains
  • S. Janson
  • Mathematics
    Combinatorics, Probability and Computing
  • 2008
TLDR
This work studies the asymptotic distribution of the displacements in hashing with coalesced chains, for both late-insertion and early- Insertion, using Poissonization and some stochastic calculus.
A New Approach to Analyzing Robin Hood Hashing
TLDR
It is shown that a simple but apparently unstudied approach for handling deletions with Robin Hood hashing offers good performance even under high loads.
Random hypergraphs for hashing-based data structures
TLDR
This thesis examines how hyperedge distribution and load affects the probabilities with which these properties hold and derive corresponding thresholds, and identifies a hashing scheme that leads to a particularly high threshold value in this regard.
Two-way hashing with separate chaining and linear probing
TLDR
An Ω(log log n) universal lower bound is proved on the worst-case search time of any two-way linear probing algorithm, where n is the hash table size.
...
1
2
3
...

References

SHOWING 1-10 OF 46 REFERENCES
Individual displacements for linear probing hashing with different insertion policies
TLDR
It is shown, using the diagonal Poisson transform studied by Poblete, Viola and Munro, that exact expressions for finite m and n can be obtained from the limits as m,n → ∞.
Analysis of hashing algorithms and a new mathematical transform
The main contribution of this thesis is the introduction of a new mathematical tool that we call the Diagonal Poisson Transform, and its application to the analysis of some linear probing hashing
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models are considered, that
Robin hood hashing
TLDR
This paper deals with hash tables in which conflicts are resolved by open addressing with a very simple insertion procedure which leads to a new search procedure which requires only a constant number of probes, on average, even for full tables.
The diagonal Poisson transform and its application to the analysis of a hashing scheme
TLDR
It is shown that the Robin Hood heuristic achieves minimum variance over all linear probing algorithms up to lower-order terms, and an accurate analysis of this algorithm is made by introducing a new transform which is called the Diagonal Poisson Transform as it resembles the Poisson transform.
Analysis of Uniform Hashing
TLDR
Earlier analyses of umform hashing are extended here to multlrecord buckets and three different situations are analysed: initial loadmg assuming uniform access frequencies, frequency loading assuming nonuniformAccess frequencies, and the dynamic behavior when msertions and deletions occur.
Extendible hashing—a fast access method for dynamic files
TLDR
This work studies, by analysis and simulation, the performance of extendible hashing and indicates that it provides an attractive alternative to other access methods, such as balanced trees.
Last-Come-First-Served Hashing
Efficient Ordering of Hash Tables
TLDR
A scheme for reordering the table as new elements are added is presented and the minimax problem of ordering the table so as to minimize the length of the longest probe sequence to find any element is presented.
...
1
2
3
4
5
...