Design and Analysis of Parametric Query Optimization Algorithms.
Sumit Ganguly:
Design and Analysis of Parametric Query Optimization Algorithms.
VLDB 1998: 228-238@inproceedings{DBLP:conf/vldb/Ganguly98,
author = {Sumit Ganguly},
editor = {Ashish Gupta and
Oded Shmueli and
Jennifer Widom},
title = {Design and Analysis of Parametric Query Optimization Algorithms},
booktitle = {VLDB'98, Proceedings of 24rd International Conference on Very
Large Data Bases, August 24-27, 1998, New York City, New York,
USA},
publisher = {Morgan Kaufmann},
year = {1998},
isbn = {1-55860-566-5},
pages = {228-238},
ee = {db/conf/vldb/Ganguly98.html},
crossref = {DBLP:conf/vldb/98},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such as selectivity and resource availability.
The execution of such plans could be sub-optimal when cost parameters are either unknown at compile time or change significantly between compile time and runtime [Loh89, GrW89].
Parametric query optimization [INS+92, CG94, GK94] optimizes a query into a number of candidate plans, each optimal for some region of the parameterspace.
In this paper, we present parametric query optimization algorithms.
Our approach is based on the property that for linear cost functions, eachparametric optimal plan is optimal in a convex polyhedral region of the parameter space.
This property is used to optimize linear and non-linear cost functions.
We also analyze the expected sizes of the parametric optimal set of plans and the number of plans produced by the Cole and Graefe algorithm [CG94].
Copyright © 1998 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
CDROM Version: Load the CDROM "DiSC, Volume 1 Number 1" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Ashish Gupta, Oded Shmueli, Jennifer Widom (Eds.):
VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998, New York City, New York, USA.
Morgan Kaufmann 1998, ISBN 1-55860-566-5
Contents
References
- [Ant93]
- Gennady Antoshenkov:
Dynamic Query Optimization in Rdb/VMS.
ICDE 1993: 538-547
- [BKS+78]
- Jon Louis Bentley, H. T. Kung, Mario Schkolnick, Clark D. Thompson:
On the Average Number of Maxima in a Set of Vectors and Applications.
J. ACM 25(4): 536-543(1978)
- [CG94]
- Richard L. Cole, Goetz Graefe:
Optimization of Dynamic Query Evaluation Plans.
SIGMOD Conference 1994: 150-160
- [GrW89]
- Goetz Graefe, Karen Ward:
Dynamic Query Evaluation Plans.
SIGMOD Conference 1989: 358-366
- [GK94]
- Sumit Ganguly, Ravi Krishnamurthy:
Parametric Distributed Query Optimization based on Load Conditions.
COMAD 1994: 0-
- [Gan98]
- ...
- [INS+92]
- Yannis E. Ioannidis, Raymond T. Ng, Kyuseok Shim, Timos K. Sellis:
Parametric Query Optimization.
VLDB 1992: 103-114
- [Loh89]
- ...
- [Ray70]
- ...
- [RS63]
- ...
- [SAC+79]
- 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
Copyright © Tue Mar 16 02:22:07 2010
by Michael Ley (ley@uni-trier.de)