An image matrix for accessing files

Authors:
Stanley T. Schuyler;Jonathan A. Soule;Patrick F. Turchetta;Malcolm H. Gotterer
Affiliations:
Pensylvania State University;Pensylvania State University;Pensylvania State University;Pensylvania State University
Venue:
ACM '72 Proceedings of the ACM annual conference - Volume 1
Year:
1972

Citing 5
Cited 0

The quadratic quotient method: a hash code eliminating secondary clustering

Communications of the ACM
Storage utilization in a memory hierarchy when storage assignment is performed by a hashing algorithm

Communications of the ACM
The linear quotient hash code

Communications of the ACM
Programming Technique: An improved hash code for scatter storage

Communications of the ACM
Scatter storage techniques

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficiency of a file management system using direct access storage depends to a large extent upon the efficiency of its file access algorithm, the extent to which the operating environment influences file manager performance, and the effectiveness of primary storage utilization. One way to increase a system's efficiency is to reduce the number of probes necessary to access a record. Such a reduction may be accomplished by storing a small portion of a record's key in a bit matrix within primary storage. This method is effective when a section of primary storage is not used by the file management package, or when a section is occupied by component modules which are used infrequently enough to allow overlays or swapping. The effectiveness of this technique has been established through an experimental investigation.