Analysis of the Address Assignment Problem for Clustered Keys

Authors:
Junichi Toyoda;Yoshikazu Tezuka;Yoshiro Kasahara
Affiliations:
Department of Communication Engineering, Osaka University, Osaka, Japan;Department of Communication Engineering, Osaka University, Osaka, Japan;Department of Communication Engineering, Osaka University, Osaka, Japan
Venue:
Journal of the ACM (JACM)
Year:
1966

Citing 0
Cited 2

Elements of the randomized combinatorial file structure

SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	0.00

Visualization

Abstract

The occurrence pattern of clusterings of keys is analyzed by use of the generating function. Probabilities of occurrences of several clustered patterns are given as the coefficients of generating functions. Moreover, the result when a key-to-address transformation of aK + b/mod c is performed on clustered keys is briefly discussed.