Methods of Randomization of Large Files with High Volatility

Patrick C. Mitchell, Thomas K. Burgess

Abstract


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.


Full Text:

PDF


DOI: http://dx.doi.org/10.6017/ital.v3i1.5128

Refbacks

  • There are currently no refbacks.




License URL: http://creativecommons.org/licenses/by/3.0/

http://napoleon.bc.edu/ojs/public/site/images/ejadmin/lita_67

ISSN:2163-5226

SCImago Journal & Country Rank data for ITAL