Optimal Performance of Inverted Files

Jeffrey A. Hoffer and Antonio Kovacevic
Additional contact information
Jeffrey A. Hoffer: Indiana University, Bloomington, Indiana
Antonio Kovacevic: Portificia Universidad Catolica de Chile, Santiago, Chile

Operations Research, 1982, vol. 30, issue 2, 336-354

Abstract: Many managerial users of information systems require access to data based upon nonunique data record qualifications or classifications. A class of computer file organizations, called inverted files, has been devised to efficiently support such data retrieval. Fundamental to the use of such a file or database organization is the selection of data elements or keys for creation of nonunique key indexes. These indexes provide rapid access to data records which are qualified by logical key expressions. This paper formulates this selection problem as a zero-one, nonlinear programming problem with constraints and describes an optimization algorithm. The model recognizes both known and ad hoc uses of data; complex, Boolean key queries; and index storage capacity and query response time constraints. Computational experience is similar to previous algorithms, which consider more restricted problem formulations.

Keywords: 63 inverted files; 323 management information retrieval; 627 branch and bound (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.2.336 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:30:y:1982:i:2:p:336-354

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().