ACM Home Page
Please provide us with feedback. Feedback
Efficient and extensible algorithms for multi query optimization
Full text PdfPdf (198 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: 249 - 260  
Year of Publication: 2000
ISBN:1-58113-217-4
Also published in ...
Authors
Prasan Roy  I.I.T. Bombay
S. Seshadri  Bell Labs.
S. Sudarshan  I.I.T. Bombay
Siddhesh Bhobe  PSPL Ltd. Pune
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 30,   Downloads (12 Months): 153,   Citation Count: 65
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.335419
What is a DOI?

ABSTRACT

Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a single query, or across multiple such queries run as a batch. Multiquery optimization aims at exploiting common sub-expressions to reduce evaluation cost. Multi-query optimization has hither-to been viewed as impractical, since earlier algorithms were exhaustive, and explore a doubly exponential search space.

In this paper we demonstrate that multi-query optimization using heuristics is practical, and provides significant benefits. We propose three cost-based heuristic algorithms: Volcano-SH and Volcano-RU, which are based on simple modifications to the Volcano search strategy, and a greedy heuristic. Our greedy heuristic incorporates novel optimizations that improve efficiency greatly. Our algorithms are designed to be easily added to existing optimizers. We present a performance study comparing the algorithms, using workloads consisting of queries from the TPC-D benchmark. The study shows that our algorithms provide significant benefits over traditional optimization, at a very acceptable overhead in optimization time.


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.

 
CKPS95
 
CR94
Fin82
 
GHRU97
 
GM93
 
Gup97
 
PS88
Rou82
RR98
RSS96
 
RSSB98
Prasan Roy, S. Seshadri, S. Sudarshan, and Siddhesh Bhobe. Efficient and extensible algorithms for multi query optimization. Technical report, Indian Institute of Technology, Bombay, October Nov 1998.
Sel88
 
SHT+99
 
SPL96
 
SSN94
SV98
 
YL87
ZDNS98

CITED BY  65

Collaborative Colleagues:
Prasan Roy: colleagues
S. Seshadri: colleagues
S. Sudarshan: colleagues
Siddhesh Bhobe: colleagues