Methods of Randomization of Large Files with High Volatility

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 co...

Full description

Bibliographic Details
Main Authors: Patrick C. Mitchell, Thomas K. Burgess
Format: Article
Language:English
Published: American Library Association 1970-03-01
Series:Information Technology and Libraries
Online Access:https://ejournals.bc.edu/ojs/index.php/ital/article/view/5128
id doaj-c8f8628bbc7a4885862c4473e0049185
record_format Article
spelling doaj-c8f8628bbc7a4885862c4473e00491852020-11-25T01:08:04ZengAmerican Library AssociationInformation Technology and Libraries0730-92952163-52261970-03-0131798610.6017/ital.v3i1.51284627Methods of Randomization of Large Files with High VolatilityPatrick C. MitchellThomas K. BurgessKey-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.https://ejournals.bc.edu/ojs/index.php/ital/article/view/5128
collection DOAJ
language English
format Article
sources DOAJ
author Patrick C. Mitchell
Thomas K. Burgess
spellingShingle Patrick C. Mitchell
Thomas K. Burgess
Methods of Randomization of Large Files with High Volatility
Information Technology and Libraries
author_facet Patrick C. Mitchell
Thomas K. Burgess
author_sort Patrick C. Mitchell
title Methods of Randomization of Large Files with High Volatility
title_short Methods of Randomization of Large Files with High Volatility
title_full Methods of Randomization of Large Files with High Volatility
title_fullStr Methods of Randomization of Large Files with High Volatility
title_full_unstemmed Methods of Randomization of Large Files with High Volatility
title_sort methods of randomization of large files with high volatility
publisher American Library Association
series Information Technology and Libraries
issn 0730-9295
2163-5226
publishDate 1970-03-01
description 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.
url https://ejournals.bc.edu/ojs/index.php/ital/article/view/5128
work_keys_str_mv AT patrickcmitchell methodsofrandomizationoflargefileswithhighvolatility
AT thomaskburgess methodsofrandomizationoflargefileswithhighvolatility
_version_ 1725184557685145600