Analysis of the Address Assignment Problem for Clustered Keys
暂无分享,去创建一个
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 <italic>aK</italic> + <italic>b</italic>/mod <italic>c</italic> is performed on clustered keys is briefly discussed.
[1] Maurice Hanan,et al. An Application of Coding Theory to a File Address Problem , 1963, IBM J. Res. Dev..