QUIST: A System for Semantic Query Optimization in Relational Databases.
Jonathan J. King:
QUIST: A System for Semantic Query Optimization in Relational Databases.
VLDB 1981: 510-517@inproceedings{DBLP:conf/vldb/King81,
author = {Jonathan J. King},
title = {QUIST: A System for Semantic Query Optimization in Relational
Databases},
booktitle = {Very Large Data Bases, 7th International Conference, September
9-11, 1981, Cannes, France, Proceedings},
publisher = {IEEE Computer Society},
year = {1981},
pages = {510-517},
ee = {db/conf/vldb/King81.html},
crossref = {DBLP:conf/vldb/81},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Semanfic query ophizotion is an approach to query optimization
that uses knowledge of the semantics of the data to transform a query
into another query that has the same answer but can be processed
more efficiently. However, the indiscriminate application of
semantic transformations can itself be excessively costly when there
are many semantic rules upon which transformations can be based.
This paper describes a semantic query optimization system called
QUIST (Query lmprovement through Semantic Transformation).
QUIST demonstrates significant cost reductions for a class of
relational database queries. At the same time, QUIST uses
knowledge about relational database structures and processing
methods to insure that semantic transformations are applied
selectively. This knowledge reflects cost models and optimization
techniques developed in recent query optimization research. To
integrate semantic, structure, and processing knowledge, QUIST
analyzes a query at several levels of detail, along the lines of the
plan-generate-test paradigm of artificial intelligence systems.
Copyright © 1981 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Very Large Data Bases, 7th International Conference, September 9-11, 1981, Cannes, France, Proceedings.
IEEE Computer Society 1981
Contents
References
- [Buchanan76]
- ...
- [Carlson76]
- C. Robert Carlson, Robert S. Kaplan:
A Generalized Access Path Model and its Application to a Relational Data Base System.
SIGMOD Conference 1976: 143-154
- [Couper72]
- ...
- [Feigenbaum71]
- ...
- [Gotlieb75]
- Leo R. Gotlieb:
Computing Joins of Relations.
SIGMOD Conference 1975: 55-63
- [Hammer80]
- Michael Hammer, Stanley B. Zdonik:
Knowledge-Based Query Processing.
VLDB 1980: 137-147
- [Hendrix78]
- Gary G. Hendrix, Earl D. Sacerdoti, Daniel Sagalowicz, Jonathan Slocum:
Developing a Natural Language Interface to Complex Data.
ACM Trans. Database Syst. 3(2): 105-147(1978)
- [King79]
- ...
- [King81a]
- ...
- [King81b]
- ...
- [Lenat76]
- ...
- [Moore79]
- ...
- [Sagalowicz77]
- Daniel Sagalowicz:
IDA: An Intelligent Data Access Program.
VLDB 1977: 293-302
- [Selinger79]
- Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price:
Access Path Selection in a Relational Database Management System.
SIGMOD Conference 1979: 23-34
- [Stonebraker75]
- Michael Stonebraker:
Implementation of Integrity Constraints and Views by Query Modification.
SIGMOD Conference 1975: 65-78
- [Teitelman78]
- ...
- [Wilson80]
- Gerald A. Wilson:
A Conceptual Model for Semantic Integrity Checking.
VLDB 1980: 111-125
- [Yao79]
- S. Bing Yao:
Optimization of Query Evaluation Algorithms.
ACM Trans. Database Syst. 4(2): 133-155(1979)
- [Youssefi79]
- ...
Copyright © Tue Mar 16 02:21:56 2010
by Michael Ley (ley@uni-trier.de)