ACM Home Page
Please provide us with feedback. Feedback
SQL query optimization: reordering for a general class of queries
Full text PdfPdf (944 KB)
Source International Conference on Management of Data archive
Proceedings of the 1996 ACM SIGMOD international conference on Management of data table of contents
Montreal, Quebec, Canada
Pages: 47 - 56  
Year of Publication: 1996
ISBN:0-89791-794-4
Also published in ...
Authors
Piyush Goel  IBM Santa Teresa Laboratory
Bala Iyer  IBM Santa Teresa Laboratory
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 90,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/233269.233318
What is a DOI?

ABSTRACT

The strength of commercial query optimizers like DB2 comes from their ability to select an optimal order by generating all equivalent reorderings of binary operators. However, there are no known methods to generate all equivalent reorderings for a SQL query containing joins, outer joins, and groupby aggregations. Consequently, some of the reorderings with significantly lower cost may be missed. Using hypergraph model and a set of novel identities, we propose a method to reorder a SQL query containing joins, outer joins, and groupby aggregations. While these operators are sufficient to capture the SQL semantics, it is during their reordering that we identify a powerful primitive needed for a dbms. We report our findings of a simple, yet fundamental operator, generalized selection, and demonstrate its power to solve the problem of reordering of SQL queries containing joins, outer joins, and groupby aggregations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
BHAR94
Bhargava, G., Goel, P. and Iyer, B., "Reordering of complex queries involving joins and outer joins," IBM Techn,cal Report TR03.567, July b1994.
BHAR95a
 
BHAR95b
 
BHAR95c
 
BHAR95d
 
GALI92a
 
GALI92b
GALI94
GANS87
 
GUPT95
Gupta, A., Harinarayan, V. and Quass, D., "Generalized Projections: A powerful approach to aggregation", To appear in VLDB, 1995.
 
MURA92
PIRA92
ROSE90
SELI79