Affiliation:
1. AT&T Bell Laboratories and IBM Almaden Research Center and Stanford University
2. IBM Almaden Research Center
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Reference24 articles.
1. F. Bancilhon D. Maier Y. Sagiv and J. Ullman. Magic sets and other strange ways to implement logic programs. In PODS I986. 10.1145/6012.15399 F. Bancilhon D. Maier Y. Sagiv and J. Ullman. Magic sets and other strange ways to implement logic programs. In PODS I986. 10.1145/6012.15399
2. On the power of magic
3. Design and implementation of the glue-nail database system
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献