Cost-Based Optimization for Magic: Algebra and Implementation (1996)
Cached
Download Links
- [www.cs.berkeley.edu]
- [s2k-ftp.cs.berkeley.edu:8000]
- [db.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of ACM SIGMOD |
| Citations: | 21 - 1 self |
BibTeX
@INPROCEEDINGS{Seshadri96cost-basedoptimization,
author = {Praveen Seshadri and Joseph M. Hellerstein and Hamid Pirahesh and T. Y. Cliff Leung and Raghu Ramakrishnan and Divesh Srivastava and Peter J. Stuckey and S. Sudarshan},
title = {Cost-Based Optimization for Magic: Algebra and Implementation},
booktitle = {In Proc. of ACM SIGMOD},
year = {1996},
pages = {435--446}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which differ greatly in execution performance. We propose cost-based techniques for selecting an efficient variant from the many choices. Our first contribution is a practical scheme that modelsmagic sets rewriting as a special join method that can be added to any cost-based query optimizer. We derive cost formulas that allow an optimizer to choose the best variant of the rewriting and to decide whether it is beneficial. The order of complexity of the optimization process is preserved by limiting the search space in a reasonable manner. We have implemented this technique in IBM's DB2 C/S V2 database system. Our performance measurements demonstrate that the costbasedmagic optimization technique performs well, and that without it, several poor decisions could be made. Our second contribution is a formal algebraic model of ...
