 |
|
|
An Overview of Query Optimization in Relational Systems |
Full Paper (PDF)
Slides (HTML)
References, where available, link to the DBLP on the World Wide Web.
[1]Peter M. G. Apers, Alan R. Hevner, S. Bing Yao:
Optimization Algorithms for Distributed Queries.
TSE 9(1): 57-68(1983)[2]François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman:
Magic Sets and Other Strange Ways to Implement Logic Programs.
PODS 1986: 1-16[3]Philip A. Bernstein, Nathan Goodman, Eugene Wong, Christopher L. Reeve, James B. Rothnie Jr.:
Query Processing in a System for Distributed Databases (SDD-1).
TODS 6(4): 602-625(1981)[4]Surajit Chaudhuri, Kyuseok Shim:
An Overview of Cost-based Optimization of Queries with Aggregates.
Data Engineering Bulletin 18(3): 3-9(1995)[5]Surajit Chaudhuri, Kyuseok Shim:
Including Group-By in Query Optimization.
VLDB 1994: 354-366[6]Surajit Chaudhuri, Kyuseok Shim:
Optimizing Queries with Aggregate Views.
EDBT 1996: 167-182[7]Surajit Chaudhuri, Umeshwar Dayal:
An Overview of Data Warehousing and OLAP Technology.
SIGMOD Record 26(1): 65-74(1997)[8]Surajit Chaudhuri, Kyuseok Shim:
Optimization of Queries with User-defined Predicates.
VLDB 1996: 87-98[9]Surajit Chaudhuri, Ravi Krishnamurthy, Spyros Potamianos, Kyuseok Shim:
Optimizing Queries with Materialized Views.
ICDE 1995: 190-200[10]Surajit Chaudhuri, Luis Gravano:
Optimizing Queries over Multimedia Repositories.
SIGMOD Conf. 1996: 91-102[11]Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasayya:
Random Sampling for Histogram Construction: How much is enough?
SIGMOD Conference 1998: 436-447[12]Danette Chimenti, Ruben Gamboa, Ravi Krishnamurthy:
Towards on Open Architecture for LDL.
VLDB 1989: 195-203[13]Umeshwar Dayal:
Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers.
VLDB 1987: 197-208[14]Ronald Fagin:
Combining Fuzzy Information from Multiple Systems.
PODS 1996: 216-226[15]Sheldon J. Finkelstein:
Common Subexpression Analysis in Database Applications.
SIGMOD Conference 1982: 235-245[16]Richard A. Ganski, Harry K. T. Wong:
Optimization of Nested SQL Queries Revisited.
SIGMOD Conference 1987: 23-33[17]Peter Gassner, Guy M. Lohman, K. Bernhard Schiefer, Yun Wang:
Query Optimization in the IBM DB2 Family.
Data Engineering Bulletin 16(4): 4-18(1993)[18]Phillip B. Gibbons, Yossi Matias, Viswanath Poosala:
Fast Incremental Maintenance of Approximate Histograms.
VLDB 1997: 466-475[19]Goetz Graefe, Karen Ward:
Dynamic Query Evaluation Plans.
SIGMOD Conference 1989: 358-366[20]Goetz Graefe:
Query Evaluation Techniques for Large Databases.
Computing Surveys 25(2): 73-170(1993)[21]Goetz Graefe:
The Cascades Framework for Query Optimization.
Data Engineering Bulletin 18(3): 19-29(1995)[22]Goetz Graefe, David J. DeWitt:
The EXODUS Optimizer Generator.
SIGMOD Conference 1987: 160-172[23]Goetz Graefe, William J. McKenna:
The Volcano Optimizer Generator: Extensibility and Efficient Search.
ICDE 1993: 209-218[24]Jim Gray, Adam Bosworth, Andrew Layman, Hamid Pirahesh:
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total.
ICDE 1996: 152-159[25]Ashish Gupta, Venky Harinarayan, Dallan Quass:
Aggregate-Query Processing in Data Warehousing Environments.
VLDB 1995: 358-369[26]Laura M. Haas, Johann Christoph Freytag, Guy M. Lohman, Hamid Pirahesh:
Extensible Query Processing in Starburst.
SIGMOD Conference 1989: 377-388[27]Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Lynne Stokes:
Sampling-Based Estimation of the Number of Distinct Values of an Attribute.
VLDB 1995: 311-322[28]...
[29]Joseph M. Hellerstein, Michael Stonebraker:
Predicate Migration: Optimizing Queries with Expensive Predicates.
SIGMOD Conference 1993: 267-276[30]Joseph M. Hellerstein:
Practical Predicate Placement.
SIGMOD Conference 1994: 325-335[31]Wei Hong, Michael Stonebraker:
Optimization of Parallel Query Execution Plans in XPRS.
PDIS 1991: 218-225[32]...
[33]Yannis E. Ioannidis, Raymond T. Ng, Kyuseok Shim, Timos K. Sellis:
Parametric Query Optimization.
VLDB 1992: 103-114[34]Yannis E. Ioannidis:
Universality of Serial Histograms.
VLDB 1993: 256-267[35]Won Kim:
On Optimizing an SQL-like Nested Query.
TODS 7(3): 443-469(1982)[36]Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv:
Query Optimization by Predicate Move-Around.
VLDB 1994: 96-107[37]Guy M. Lohman:
Grammar-like Functional Rules for Representing Query Optimization Alternatives.
SIGMOD Conference 1988: 18-27[38]...
[39]Lothar F. Mackert, Guy M. Lohman:
R* Optimizer Validation and Performance Evaluation for Distributed Queries.
VLDB 1986: 149-159[40]Lothar F. Mackert, Guy M. Lohman:
R* Optimizer Validation and Performance Evaluation for Local Queries.
SIGMOD Conference 1986: 84-95[41]Jim Melton, Alan R. Simon:
Understanding the New SQL: A Complete Guide.
Morgan Kaufmann 1993, ISBN 1-55860-245-3
Contents[42]Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan:
Magic is Relevant.
SIGMOD Conference 1990: 247-258[43]Inderpal Singh Mumick, Hamid Pirahesh:
Implementation of Magic-sets in a Relational Database System.
SIGMOD Conference 1994: 103-114[44]M. Muralikrishna:
Improved Unnesting Algorithms for Join Aggregate SQL Queries.
VLDB 1992: 91-102[45]M. Muralikrishna, David J. DeWitt:
Equi-Depth Histograms For Estimating Selectivity Factors For Multi-Dimensional Queries.
SIGMOD Conference 1988: 28-36[46]Kiyoshi Ono, Guy M. Lohman:
Measuring the Complexity of Join Enumeration in Query Optimization.
VLDB 1990: 314-325[47]M. Tamer Özsu, Patrick Valduriez:
Principles of Distributed Database Systems.
Prentice-Hall 1991, ISBN 1-13-715681-2
[48]Gregory Piatetsky-Shapiro, Charles Connell:
Accurate Estimation of the Number of Tuples Satisfying a Condition.
SIGMOD Conference 1984: 256-276[49]Hamid Pirahesh, Joseph M. Hellerstein, Waqar Hasan:
Extensible/Rule Based Query Rewrite Optimization in Starburst.
SIGMOD Conference 1992: 39-48[50]Viswanath Poosala, Yannis E. Ioannidis, Peter J. Haas, Eugene J. Shekita:
Improved Histograms for Selectivity Estimation of Range Predicates.
SIGMOD Conf. 1996: 294-305[51]Viswanath Poosala, Yannis E. Ioannidis:
Selectivity Estimation Without the Attribute Value Independence Assumption.
VLDB 1997: 486-495[52]Viswanath Poosala, Yannis E. Ioannidis, Peter J. Haas, Eugene J. Shekita:
Improved Histograms for Selectivity Estimation of Range Predicates.
SIGMOD Conf. 1996: 294-305[53]Arnon Rosenthal, César A. Galindo-Legaria:
Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins.
SIGMOD Conference 1990: 291-299[54]...
[55]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[56]Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan:
Cost-Based Optimization for Magic: Algebra and Implementation.
SIGMOD Conf. 1996: 435-446[57]Praveen Seshadri, Hamid Pirahesh, T. Y. Cliff Leung:
Complex Query Decorrelation.
ICDE 1996: 450-458[58]David E. Simmen, Eugene J. Shekita, Timothy Malkemus:
Fundamental Techniques for Order Optimization.
SIGMOD Conf. 1996: 57-67[59]Divesh Srivastava, Shaul Dar, H. V. Jagadish, Alon Y. Levy:
Answering Queries with Aggregation Using Views.
VLDB 1996: 318-329[60]Weipeng P. Yan, Per-Åke Larson:
Eager Aggregation and Lazy Aggregation.
VLDB 1995: 345-357[61]H. Z. Yang, Per-Åke Larson:
Query Transformation for PSJ-Queries.
VLDB 1987: 245-254
|
@inproceedings{DBLP:conf/pods/Chaudhuri98,
author = {Surajit Chaudhuri},
title = {An Overview of Query Optimization in Relational Systems},
booktitle = {Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium
on Principles of Database Systems, June 1-3, 1998, Seattle, Washington},
publisher = {ACM Press},
year = {1998},
isbn = {0-89791-966-3},
pages = {34-43},
crossref = {DBLP:conf/pods/98},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
|
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
