Thumbnail
Access Restriction
Subscribed

Author Lozano, Tomas ♦ Rothnie, James B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Inverted file ♦ Paging ♦ Multiple key hashing ♦ File organization ♦ Retrieval algorithm
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.
Description Affiliation: Massachusetts Institute of Technology, Cambridge (Rothnie, James B.; Lozano, Tomas)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 2
Page Count 7
Starting Page 63
Ending Page 69


Open content in new tab

   Open content in new tab
Source: ACM Digital Library