Attribute based file organization in a paged memory environment
- 1 February 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (2) , 63-69
- https://doi.org/10.1145/360827.360831
Abstract
The high cost of page accessing implies a need for for more careful data organization in a paged memory than is typical of most inverted file and similar approaches to multi-key retrieval. This article analyses that cost and proposes a method called multiple key hashing which attempts to minimize it. Since this approach is not always preferable to inversion, a combined method is described. The exact specifications of this combination for a file with given data and traffic characteristics is formulated as a mathematical program. The proposed heuristic solution to this program can often improve on a simple inversion technique by a factor of 2 or 3.Keywords
This publication has 3 references indexed in Scilit:
- Elements of the randomized combinatorial file structurePublished by Association for Computing Machinery (ACM) ,1971
- A formal system for information retrieval from filesCommunications of the ACM, 1970
- Techniques of Search File OrganizationPublished by Springer Nature ,1969