Query Execution and Index Selection for Relational Data Bases.

Gilles Farley, Stewart A. Schuster: Query Execution and Index Selection for Relational Data Bases. VLDB 1975: 519

@inproceedings{DBLP:conf/vldb/FarleyS75,
  author    = {Gilles Farley and
               Stewart A. Schuster},
  editor    = {Douglas S. Kerr},
  title     = {Query Execution and Index Selection for Relational Data Bases},
  booktitle = {Proceedings of the International Conference on Very Large Data
               Bases, September 22-24, 1975, Framingham, Massachusetts, USA},
  publisher = {ACM},
  year      = {1975},
  pages     = {519},
  ee        = {db/conf/vldb/FarleyS75.html},
  crossref  = {DBLP:conf/vldb/75},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Abstract

An algorithm to evaluate primitive Boolean selections over single relations is presented. It will be argued that the algorithm is efficient with respect to the number of relational accesses and with respect to the merging of inverted lists. The algorithm's unique quality is its efficiency in evaluating selections over partially inverted relations. A simple cost function is used to drive the algorithm along the most efficient access paths. The cost function can also be used to predict its response time which then forms the basis of a procedure to suboptimize the selection of the domains tobe inverted. The domains to be inverted are selected by analyzing, with respect to their costs, a sample of queries. Such a method does away with usual methods of updating usage counters for every domain and relation in thesystem. In this approach, the selection of a good set of inverted lists is based on the algorithm which uses those lists.

Copyright © 1975 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

BibTeX

Printed Edition

Douglas S. Kerr (Ed.): Proceedings of the International Conference on Very Large Data Bases, September 22-24, 1975, Framingham, Massachusetts, USA. ACM 1975
Contents BibTeX

References

[1]: ...

Referenced by

Grant E. Weddell: Selection of Indexes to Memory-Resident Entities for Semantic Data Models. IEEE Trans. Knowl. Data Eng. 1(2): 274-284(1989)
Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984)
Nick Roussopoulos: View Indexing in Relational Databases. ACM Trans. Database Syst. 7(2): 258-290(1982)
Kenneth C. Sevcik: Data Base System Performance Prediction Using an Analytical Model (Invited Paper). VLDB 1981: 182-198
Mario Schkolnick: A Survey of Physical Database Design Methodology and Techniques. VLDB 1978: 474-487
Peter P. Chen, S. Bing Yao: Design and Performance Tools for Data Base Systems. VLDB 1977: 3-15
T. H. Merrett: Database Cost Analysis: a Top-Down Approach. SIGMOD Conference 1977: 135-143
Donald D. Chamberlin: Relational Data-Base Management Systems. ACM Comput. Surv. 8(1): 43-66(1976)
Michael Hammer, Arvola Chan: Index Selection in a Self-Adaptive Data Base Management System. SIGMOD Conference 1976: 1-8
Hans Albrecht Schmid, Philip A. Bernstein: A Multi-Level Architecture for Relational Data Base Systems. VLDB 1975: 202-226

BibTeX

ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]