ACM Home Page
Please provide us with feedback. Feedback
Answering complex SQL queries using automatic summary tables
Full text PdfPdf (186 KB)
Source International Conference on Management of Data archive
Proceedings of the 2000 ACM SIGMOD international conference on Management of data table of contents
Dallas, Texas, United States
Pages: 105 - 116  
Year of Publication: 2000
ISBN:1-58113-217-4
Also published in ...
Authors
Markos Zaharioudakis  IBM Almaden Research Center, San Jose, CA
Roberta Cochrane  IBM Almaden Research Center, San Jose, CA
George Lapis  IBM Almaden Research Center, San Jose, CA
Hamid Pirahesh  IBM Almaden Research Center, San Jose, CA
Monica Urata  IBM Almaden Research Center, San Jose, CA
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 89,   Citation Count: 48
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/342009.335390
What is a DOI?

ABSTRACT

We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (possibly user-defined) functions, aggregation (often along multiple dimensions), and nested subqueries. Given the complexity of such queries, the vast amounts of data upon which they operate, and the requirement for interactive response times, the use of materialized views (MVs) of similar complexity is often mandatory for acceptable performance. We present a novel algorithm that is able to rewrite a user query so that it will access one or more of the available MVs instead of the base tables. The algorithm extends prior work by addressing the new sources of complexity mentioned above, that is, complex expressions, multidimensional aggregation, and nested subqueries. It does so by relying on a graphical representation of queries and a bottom-up, pair-wise matching of nodes from the query and MV graphs. This approach offers great modularity and extensibility, allowing for the rewriting of a large class of queries.


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.

 
1
 
2
3
 
4
5
 
6
7
8
 
9
J. Melton (ed.), "Final Committee Draft- Database Language SQL- Part 2: Foundation (SQL/Foundation)", H2-98-519/DBL FRA-017, 1998.
10
11
 
12
 
13
Zaharioudakis, R. Cochrane, G. Lapis, H. Pirahesh, M. Urata, "Answering Complex SQL Queries Using Automated Summary Tables", available upon request from the authors.

CITED BY  48

Collaborative Colleagues:
Markos Zaharioudakis: colleagues
Roberta Cochrane: colleagues
George Lapis: colleagues
Hamid Pirahesh: colleagues
Monica Urata: colleagues