• Corpus ID: 50608179

More Analysis of Double Hashingt

@inproceedings{Lueker2005MoreAO,
  title={More Analysis of Double Hashingt},
  author={George S. Lueker and Mariko Molodowitch},
  year={2005}
}
In [8], a deep and elegant analysis shows that double hashing is equivalent to the ideal uniform hashing up to a load factor of about 0.319. In this paper we give an analysis which extends this to load factors arbitrarily close to 1. We understand from [6, 7] that Ajtai, Guibas, KomlSs, and Szemer@di obtained this result in the first part of 1986; the analysis in this paper is of interest nonetheless because we demonstrate how a randomization technque can be used to obtain a remarkably simple… 

Figures from this paper

References

SHOWING 1-10 OF 20 REFERENCES
The Analysis of Double Hashing
More analysis of double hashing
TLDR
An analysis of double hashing up to load factors arbitrarily close to 1.0 is given, which demonstrates how a resampling technique can be used to obtain a remarkably simple proof.
Uniform hashing is optimal
  • A. Yao
  • Mathematics, Computer Science
    JACM
  • 1985
TLDR
It is shown that, for any open-address hashing scheme, the expected cost of retrieving a record from a large table that is α-fraction full is at least (1/α) log (1/(1 - α)) + o(1).
The cost distribution of clustering in random probing
TLDR
The probability-generating function in closed form for the asymptotic cost of insertion via random probing with secondary clustering and higher-order clustering is derived and it is shown that all the moments of the probability distribution of the insertion cost exist and are asymPTotically equal to the corresponding Moments of the cost distribution under uniform hashing.
Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation
Abstract : The paper contains two basic theorems which generalize results of Anderson and Samuels (1967) and Jogdeo (1967). These two theorems serve as lemmas for the more detailed results of
Probability Inequalities for sums of Bounded Random Variables
Abstract Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S
The art of computer programming: sorting and searching (volume 3)
Apparatus for supporting different nets for various sporting purposes including interengaging tubular rods which are arranged to interconnect and have ground engaging portions suitable to be useful
GUIBAS and ENDRE SZEMERI~DI: The Analysis of Double Hashing
  • Journal of Computer and System Sciences
  • 1978
The Differencing Method of Set Partitioning
...
...