(Enter summary)
Abstract: The magic rewriting focuses on relevant data but suffers from additional rules, predicates,
and tuples that are generated in search for the relevant data. Reducing the arity of predicates
can cut down the number of such rules, predicates, and tuples by an exponential factor. In this
paper, we consider a subclass of linear single-IDB programs and show that the magic rewriting
can be decomposed in such a way that it is applied to only programs having smaller arities and
fewer recursive... (Update)
Active bibliography (related documents): More All
0.7: Adornments in Database Programs - Mumick, Pirahesh, Ramakrishnan (1993)
(Correct)
0.5: Indexed Step-Wise Semi-Naive Evaluation for Recursive Queries - Wang, Zhang
(Correct)
0.5: Pushing Semantics inside Recursion: A General Framework.. - Lakshmanan, Missaoui (1995)
(Correct)
Similar documents based on text: More All
0.1: The Relevance of Education to Software Practitioners: Data from .. - Lethbridge (1999)
(Correct)
0.1: ArrangePak, OrthoPak, and VisPak 2.0 - Closson, Everett, Gartshore..
(Correct)
0.1: Weakly Independent Database Schemes - Wang, Zhang, Chau
(Correct)
BibTeX entry: (Update)
@article{ wang95decomposition,
author = "Ke Wang and Weining Zhang and Siu-Cheung Chau",
title = "Decomposition of Magic Rewriting",
journal = "Journal of the ACM",
volume = "42",
number = "2",
pages = "329--381",
year = "1995",
url = "citeseer.ist.psu.edu/296857.html" }
Citations (may not include all citations):
981
Principles of database and knowledge base systems (context) - Ullman - 1988
204
Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
147
An amateur's introduction to recursive query processing stra.. (context) - Bancilhon, Ramakrishnan - 1986
121
the power of magic
- Beeri, Ramakrishnan - 1987
115
Magic templates: a spellbinding approach to logic programs
- Ramakrishnan - 1988
50
The magic of duplicates and aggregates
- Mumick, Pirahesh et al. - 1990
50
Bottom-up beats top-down for datalog (context) - Ullman - 1989
40
Implementation of logical query languages for databases (context) - Ullman - 1985
26
The Alexander method --- a technique for the processing of r.. (context) - Rohmer, Lescoeur et al. - 1986
21
Argument reduction by factoring (context) - Naughton, Ramakrishnan et al. - 1989
20
Magic is relevant
- Mumick, Finkelstein et al. - 1990
9
the implementation of a simple class of logic queries for da.. (context) - Sacca, Zaniolo - 1986
8
Mixed-approach algorithms for transitive closure (context) - Jakobsson - 1991
8
Compiling separable recursions (context) - Naughton - 1988
6
Overbound and right-linear queries
- Mumick, Pirahesh - 1991
4
Counting methods for cyclic relations (context) - Haddad, Naughton - 1988
2
Efficient evaluation of right-, left-, and multi-linear rule.. (context) - Naughton, Ramakrishnan et al. - 1989
2
Extending the right-linear transformation (context) - Mumick, Pirahesh - 1991
2
Right-, left- and multi-linear rule transformation that main..
- Kemp, Ramamohanarao et al. - 1990
1
the power of continuation passing, Part I: an analysis of re.. (context) - Seki - 1988
Documents on the same site (http://www.comp.nus.edu.sg/~dblab/dsc-db.html): More
QUICK - A Graphical User Interface to Genome Multidatabases - Tan, Wang, Wong
(Correct)
Detecting Data Inconsistency for Multidatabases - Wang, Zhang
(Correct)
QUICK: Graphical User Interface to Multiple Databases - Tan, Wang, Wong (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC