dblp.uni-trier.de www.dagstuhl.de www.uni-trier.de

Multiple Query Processing in Deductive Databases using Query Graphs.

Upen S. Chakravarthy, Jack Minker: Multiple Query Processing in Deductive Databases using Query Graphs. VLDB 1986: 384-391
@inproceedings{DBLP:conf/vldb/ChakravarthyM86,
  author    = {Upen S. Chakravarthy and
               Jack Minker},
  editor    = {Wesley W. Chu and
               Georges Gardarin and
               Setsuo Ohsuga and
               Yahiko Kambayashi},
  title     = {Multiple Query Processing in Deductive Databases using Query
               Graphs},
  booktitle = {VLDB'86 Twelfth International Conference on Very Large Data Bases,
               August 25-28, 1986, Kyoto, Japan, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1986},
  isbn      = {0-934613-18-4},
  pages     = {384-391},
  ee        = {http://www.vldb.org/conf/1986/P384.PDF},
  crossref  = {DBLP:conf/vldb/86},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Research activity on query evaluation and optimization has been centered around processing one query at a time. Query processing systems, in general, attempt to minimize the cost of processing a set of queries by minimizing the processing cost of each query separately. A separate plan is generated and executed for each query. The cost of processing (that is the CPU cost + Input/Output cost) a set of queries evaluated in the above manner is equal to the sum of the processing cost for each query. In this paper we extend the connection graph decomposition algorithm to generate a single plan for evaluating a set of queries. The approach presented in this paper is aimed at generating a single plan. exploiting the common subexpressions that can be detected using heuristics. We assume, for the purposes of this paper, that we are answering queries over a deductive database, although the approach is equally applicable to a group of independent queries.

Copyright © 1986 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.


Printed Edition

Wesley W. Chu, Georges Gardarin, Setsuo Ohsuga, Yahiko Kambayashi (Eds.): VLDB'86 Twelfth International Conference on Very Large Data Bases, August 25-28, 1986, Kyoto, Japan, Proceedings. Morgan Kaufmann 1986, ISBN 0-934613-18-4
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[Chak82]
Upen S. Chakravarthy, Jack Minker: Processing Multiple Queries in Database Systems. IEEE Database Eng. Bull. 5(3): 38-43(1982) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Chak85]
...
[Gran80]
John Grant, Jack Minker: Optimization in Deductive and Conventional Relational Database Systems. Advances in Data Base Theory 1979: 195-234 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Jark84]
Matthias Jarke: Common Subexpression Isolation in Multiple Query Optimization. Query Processing in Database Systems 1985: 191-205 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Kim80]
...
[Maie83]
David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Ullm82]
Jeffrey D. Ullman: Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Wong76]
Eugene Wong, Karel Youssefi: Decomposition - A Strategy for Query Processing. ACM Trans. Database Syst. 1(3): 223-241(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Last update Mon Sep 17 22:00:42 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page