Attribute Based File Organization in a Paged Memory Environment

The high cost of page accessing implies a need
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.

CACM February,1974

Rothnie, J. B. Jr.
Lozano, T.

file organization, paging, retrieval algorithm,
inverted file, multiple key hashing

3.70 3.73 3.74 3.79

CA740201 JB January 18, 1978  1:37 PM

2160	4	2688
2688	4	2688
2114	5	2688
2688	5	2688
2688	5	2688
2688	5	2688
2976	5	2688
2688	6	2688
2765	6	2688
2882	6	2688