Addressing for Random-Access Storage with Multiple Bucket Capacities
M. Tainiter · Journal of the ACM · 1963
Search-time probabilities are obtained for records stored in a random-access storage.Each bucket of the storage has an n-record capacity.The records are stored using a modified open-addressing system first introduced by Schay and Spruth.The equations were solved on the 7090 and results are given in the appendix for various n's and loading factors.