Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/on-searching-transposed-files-rsUQ98vxtF
References (22)
-
G. Wiederhold (1977)
Database Design -
Jair Babad (1977)
A record and file partitioning modelCommun. ACM, 20
-
S. Yao (1977)
Approximating block accesses in database organizationsCommun. ACM, 20
-
P. Dearnley (1974)
A Model of a Self-Organising Data Management SystemComput. J., 17
-
Frank Benner (1899)
On designing generalized file records for management information systems -
J. Hoffer, D. Severance (1975)
The use of cluster analysis in physical data base design -
James Martin (1975)
Computer Data-Base Organization -
H. Thiess (1965)
System optimization: Mathematical programming techniques for optimal computer use -
A. Aho, J. Hopcroft, J. Ullman (1974)
The Design and Analysis of Computer Algorithms -
M. Blasgen, K. Eswaran (1977)
Storage and Access in Relational Data BasesIBM Syst. J., 16
-
(1978)
Received July -
F. Germano, S. Weyl (1975)
A Data Base Organization to Support a Time-Oriented Medical Record -
B. Shneiderman, V. Goodman (1976)
Batched searching of sequential and tree structured filesACM Trans. Database Syst., 1
-
Y. Seppälä (1967)
Definition of extraction files and their optimization by zero-one programmingBIT Numerical Mathematics, 7
-
M. Eisner, D. Severance (1976)
Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJ. ACM, 23
-
J. Hoffer (1975)
A clustering approach to the generation of subfiles for the design of a computer data base. -
Bahram Niamir (1978)
ATTRIBUTE PARTITIONING IN A SELF-ADAPTIVE RELATIONAL DATA BASE SYSTEM -
Batory -
M. Hammer, Arvola Chan (1976)
Index selection in a self-adaptive data base management system -
R. Day (1965)
Letter to the Editor-On Optimal Extracting from a Multiple File Data Storage System: An Application of Integer ProgrammingOperations Research, 13
-
S. March, D. Severance (1977)
The determination of efficient record segmentations and blocking factors for shared data filesACM Trans. Database Syst., 2
-
(1379)
On the selection of indices for a file
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1979 by ACM Inc.
- ISSN
- 0362-5915
- DOI
- 10.1145/320107.320125
- Publisher site
- See Article on Publisher Site
Abstract
A transposed file is a collection of nonsequential files called subfiles. Each subfile contains selected attribute data for all records. It is shown that transposed file performance can be enhanced by using a proper strategy to process queries. Analytic cost expressions for processing conjunctive, disjunctive, and batched queries are developed and an effective heuristic for minimizing query processing costs is presented. Formulations of the problem of optimally processing queries for a particular family or transposed files are shown to be NP-complete. Query processing performance comparisons of multilist, inverted, and nonsequential files with transposed files are also considered.
Journal
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: Dec 1, 1979