Magic is Relevant (1990)
| Citations: | 34 - 9 self |
BibTeX
@MISC{Mumick90magicis,
author = {Inderpal Singh Mumick and Sheldon J. Finkelstein and Hamid Pirahesh and Raghu Ramakrishnan},
title = {Magic is Relevant},
year = {1990}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We define the magic-sets transformation for traditional relational systems (with duplicates, aggregation and grouping), as well as for relational systems extended with recursion. We compare the magic-sets rewriting to traditional optimization techniques for nonrecursive queries, and use performance experiments to argue that the magic-sets transformation is often a better optimization technique. 1 Introduction "Magic-sets" is the name of a query transformation algorithm ([BMSU86]) (and now a class of algorithms Part of this work was done at the IBM Almaden Research Center. Work at Stanford was supported by an NSF grant IRI87 -22886, an Air Force grant AFOSR-88-0266, and a grant of IBM Corporation. y Author's current affiliation: Tandem Computers. z Part of this work was done while the author was visiting IBM Almaden Research Center. Work at Wisconsin was supported by an IBM Faculty Development Award and an NSF grant IRI-8804319. --- Generalized Magic-sets of [BR87], Magic Tem...
