The Cost Distribution of Clustering in Random Probing
Abstract
A new approach to the analysis of random probing hashing algorithms is presented. The probability-generating function in closed form for the asymptotic cost of insertion via random probing with secondary clustering is derived. For higher-order clustering, 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. The method in this paper also leads to simple derivations for the expected cost of insertion for random probing with secondary and higher-order clustering. © 1990, ACM. All rights reserved.
Publication Title
Journal of the ACM (JACM)
Recommended Citation
Bollobás, B., Broder, A., & Simon, I. (1990). The Cost Distribution of Clustering in Random Probing. Journal of the ACM (JACM), 37 (2), 224-237. https://doi.org/10.1145/77600.77619
