Access Restriction

Author Cagley, Edgar M. ♦ Berman, William J. ♦ Pfaltz, John L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Retrieval ♦ Multiattribute ♦ Partial-match ♦ Storage access cost ♦ Bit codes
Abstract In this paper we describe a practical method of partial-match retrieval in very large data files. A binary code word, called a descriptor, is associated with each record of the file. These record descriptors are then used to form a derived descriptor for a block of several records, which will serve as an index for the block as a whole; hence, the name “indexed descriptor files.”First the structure of these files is described and a simple, efficient retrieval algorithm is presented. Then its expected behavior, in terms of storage accesses, is analyzed in detail. Two different file creation procedures are sketched, and a number of ways in which the file organization can be “tuned” to a particular application are suggested.
Description Affiliation: General Services Administration, Charlottesville, VA (Cagley, Edgar M.) || Univ. of Virginia, Charlottesville (Pfaltz, John L.; Berman, William J.)
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 23
Issue Number 9
Page Count 7
Starting Page 522
Ending Page 528

Open content in new tab

   Open content in new tab
Source: ACM Digital Library