ACM Home Page
Please provide us with feedback. Feedback
Implementation of magic-sets in a relational database system
Full text PdfPdf (1.34 MB)
Source International Conference on Management of Data archive
Proceedings of the 1994 ACM SIGMOD international conference on Management of data table of contents
Minneapolis, Minnesota, United States
Pages: 103 - 114  
Year of Publication: 1994
ISBN:0-89791-639-5
Also published in ...
Authors
Inderpal Singh Mumick  AT&T Bell Laboratories and IBM Almaden Research Center and Stanford University
Hamid Pirahesh  IBM Almaden Research Center
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 38,   Citation Count: 14
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/191839.191860
What is a DOI?

ABSTRACT

We describe the implementation of the magic-sets transformation in the Starburst extensible relational database system. To our knowledge this is the first implementation of the magic-sets transformation in a relational database system. The Starburst implementation has many novel features that make our implementation especially interesting to database practitioners (in addition to database researchers). (1) We use a cost-based heuristic for determining join orders (sips) before applying magic. (2) We push all equality and non-equality predicates using magic, replacing traditional predicate pushdown optimizations. (3) We apply magic to full SQL with duplicates, aggregation, null values, and subqueries. (4) We integrate magic with other relational optimization techniques. (5) The implementation is extensible.Our implementation demonstrates the feasibility of the magic-sets transformation for commercial relational systems, and provides a mechanism to implement magic as an integral part of a new database system, or as an add-on to an existing database system.


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.

BMSU86
 
BR91
 
Day87
DMP93
 
FF93
J. Fessy and B. Finance. Early experience with recursion optimization in an extensible rewriter. In Proceedings of the Fourth Australian Database Conference (ADC), 1993.
GM92
GW87
 
HCL+90
Kim82
Loh88
MFPR90a
MFPR90b
 
MNS+87
K. Morris, J. Naughton, Y. Saraiya, J. Ullman, and A. Van Gelder. YAWN! (Yet Another Window on Nail!). In Data Engineering 10:4, 1987.
 
MPR90
 
MPR94
I. Mumick, H. Pirahesh, and R. Ramakrishnan. Adornments in database programs. To appear in Computers and AI, 1994. Preliminary version appeaxed in Proceedings of the International Workshop on Deductive Databa#e#, International Conference on Logic Programming, 1993.
 
Mum91
 
Mur92
 
NT88
PHH92
 
Ram88
R, Ramakrishnan. Magic templates: A spellbinding approach to logic programs. In Proceedings of the Fifth International Conference and Symposium on Logic Programming, 1988.
 
RSS92
SAC+79
 
TPCD94
F. Raab. TPC-D Working Draft 6.5. In Preparation. Transaction Processing Performance Council. February 1994.
 
Ull89
 
VRK+90

CITED BY  14

Collaborative Colleagues:
Inderpal Singh Mumick: colleagues
Hamid Pirahesh: colleagues