Methods of Randomization of Large Files with High Volatility

Patrick C. Mitchell, Thomas K. Burgess
1970 Information Technology and Libraries  
<p><span>Key-to-address conversion algorithms which have been used for a large, direct access file are compared with respect to record density and access time. Cumulative distribution functions are plotted to demonstrate the distribution of addresses generated by each method. The long-standing practice of counting address collisions is shown to be less valuable in fudging algorithm effectiveness than considering the maximum number of contiguously occupied file locations.</span></p>
doi:10.6017/ital.v3i1.5128 fatcat:p7sqdyo2ozhlbp7vlsyi5ymhba