ACM SIGMOD Anthology VLDB dblp.uni-trier.de

A Formal Model of Trade-off between Optimization and Execution Costs in Semantic Query Optimization.

Shashi Shekhar, Jaideep Srivastava, Soumitra Dutta: A Formal Model of Trade-off between Optimization and Execution Costs in Semantic Query Optimization. VLDB 1988: 457-467
@inproceedings{DBLP:conf/vldb/ShekarSD88,
  author    = {Shashi Shekhar and
               Jaideep Srivastava and
               Soumitra Dutta},
  editor    = {Fran\c{c}ois Bancilhon and
               David J. DeWitt},
  title     = {A Formal Model of Trade-off between Optimization and Execution
               Costs in Semantic Query Optimization},
  booktitle = {Fourteenth International Conference on Very Large Data Bases,
               August 29 - September 1, 1988, Los Angeles, California, USA,
               Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1988},
  isbn      = {0-934613-75-3},
  pages     = {457-467},
  ee        = {db/conf/vldb/ShekarSD88.html},
  crossref  = {DBLP:conf/vldb/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

Conventional query optimizers assume that the cost of optimization is negligible. This assumption does not hold for much larger search spaces (of possible execution plans) such as those encountered during semantic query optimization. In particular, the optimization cost can become comparable to the execution cost, and thus a significant fraction of the response time for interactive queries[l]. This paper discusses the tradeoff between the two costs in the context of semantic query optimization, and reports a heuristic search algorithm which minimizes a weighted sum of both the costs. A detailed analysis of an experiment is presented to strengthen the claim. The paper also contributes a practical model of semantic query optimization, and a discussion of its search ordering and termination problems.

Copyright © 1988 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.


Online Paper

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

François Bancilhon, David J. DeWitt (Eds.): Fourteenth International Conference on Very Large Data Bases, August 29 - September 1, 1988, Los Angeles, California, USA, Proceedings. Morgan Kaufmann 1988, ISBN 0-934613-75-3
BibTeX

References

[1]
...
[2]
John Miles Smith, Philip Yen-Tang Chang: Optimizing the Performance of a Relational Algebra Database Interface. Commun. ACM 18(10): 568-579(1975) BibTeX
[3]
Eugene Wong, Karel Youssefi: Decomposition - A Strategy for Query Processing. ACM Trans. Database Syst. 1(3): 223-241(1976) BibTeX
[4]
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 BibTeX
[5]
Michael Hammer, Stanley B. Zdonik: Knowledge-Based Query Processing. VLDB 1980: 137-147 BibTeX
[6]
Jonathan J. King: QUIST: A System for Semantic Query Optimization in Relational Databases. VLDB 1981: 510-517 BibTeX
[7]
Sreekumar T. Shenoy, Z. Meral Özsoyoglu: A System for Semantic Query Optimization. SIGMOD Conference 1987: 181-195 BibTeX
[8]
Upen S. Chakravarthy, Daniel H. Fishman, Jack Minker: Semantic Query Optimization in Expert Systems and Database Systems. Expert Database Workshop 1984: 659-674 BibTeX
[9]
...
[10]
...
[11]
Richard E. Korf: Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artif. Intell. 27(1): 97-109(1985) BibTeX
[12]
...
[13]
Rina Dechter, Judea Pearl: Generalized Best-First Search Strategies and the Optimality of A*. J. ACM 32(3): 505-536(1985) BibTeX
[14]
...
[15]
Lothar F. Mackert, Guy M. Lohman: R* Optimizer Validation and Performance Evaluation for Local Queries. SIGMOD Conference 1986: 84-95 BibTeX
[16]
Timos K. Sellis: Global Query Optimization. SIGMOD Conference 1986: 191-205 BibTeX
[17]
...
[18]
Sheldon J. Finkelstein: Common Subexpression Analysis in Database Applications. SIGMOD Conference 1982: 235-245 BibTeX
[19]
Yannis E. Ioannidis, Eugene Wong: Query Optimization by Simulated Annealing. SIGMOD Conference 1987: 9-22 BibTeX
[20]
...
[21]
...

Referenced by

  1. Qi Cheng, Jarek Gryz, Fred Koo, T. Y. Cliff Leung, Linqi Liu, Xiaoyan Qian, K. Bernhard Schiefer: Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database. VLDB 1999: 687-698
  2. Marcelo F. Frias, Silvia E. Gordillo: Semantic Optimization of Queries in Deductive Object-Oriented Database. ADBIS 1995: 55-72
  3. Shashi Shekhar, Babak Hamidzadeh, Ashim Kohli, Mark Coyle: Learning Transformation Rules for Semantic Query Optimization: A Data-Driven Approach. IEEE Trans. Knowl. Data Eng. 5(6): 950-964(1993)
  4. Thodoros Topaloglou, Arantza Illarramendi, Licia Sbattella: Query Optimization for KBMSs: Temporal, Syntactic and Semantic Transformantions. ICDE 1992: 310-319
  5. HweeHwa Pang, Hongjun Lu, Beng Chin Ooi: An Efficient Semantic Query Optimization Algorithm. ICDE 1991: 326-335
  6. Kenichi Yajima, Hiroyuki Kitagawa, Kazunori Yamaguchi, Nobuo Ohbo, Yuzuru Fujiwara: Optimization of Queries Including ADT Functions. DASFAA 1991: 366-373
  7. Sreekumar T. Shenoy, Z. Meral Özsoyoglu: Design and Implementation of a Semantic Query Optimizer. IEEE Trans. Knowl. Data Eng. 1(3): 344-361(1989)
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings: Copyright © by VLDB Endowment,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:45:39 2009