Abstract
A new approach to the analysis of hash table performance is presented. This approach is based on a direct probabilistic analysis, where the underlying probabilities are derived by using the ballot theorem and its ramifications. The method is first applied to analyze the performance of the classical (cyclic) linear probing scheme, and the results are used to solve an optimal storage allocation problem. A scheme frequently used in practice where the table is linear rather than cyclic is then analyzed using the same methodology.
| Original language | English |
|---|---|
| Pages (from-to) | 474-483 |
| Number of pages | 10 |
| Journal | Journal of the ACM |
| Volume | 27 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jul 1980 |
Keywords
- ballot theorem
- collision resolution
- cyclic probing scheme
- hashing
- linear probing scheme