(Enter summary)
Abstract: We consider a bottom-up query-evaluation scheme in which facts of relations are allowed to have nonground terms.
The Magic Sets query-rewriting technique is generalized to allow arguments of predicates to be treated as bound even
though the rules do not provide ground bindings for those arguments. In particular, we regard as "bound" any argument
containing a function symbol or a variable that appears more than once in the argument list. Generalized "magic
" predicates are thus defined to... (Update)
Cited by: More
Subsumption and Indexing in Constraint Query Languages with - Linear Arithmetic..
(Correct)
Pushing Constraint Selections - Divesh Srivastava Raghu (1992)
(Correct)
OWL DL vs. OWL Flight: Conceptual Modeling and.. - de Bruijn, Lara.. (2005)
(Correct)
Similar documents (at the sentence level):
10.1%: On the Power of Magic - Beeri, Ramakrishnan (1987)
(Correct)
Active bibliography (related documents): More All
0.6: Déjà Vu in Fixpoints of Logic Programs - Maher, Ramakrishnan (1989)
(Correct)
0.5: A Survey of Research on Deductive Database Systems - Ramakrishnan, Ullman (1993)
(Correct)
0.5: Fully Distributed, AND/OR Parallel Execution of Logic Programs - Raman, Stark (1988)
(Correct)
Similar documents based on text: More All
0.2: Optimizations of Bottom-Up Evaluation with Non-Ground Terms.. - Sundarshan, al.
(Correct)
0.1: Controlling the Search in Bottom-Up Evaluation - Ramakrishnan, Srivastava.. (1992)
(Correct)
0.1: Magic Conditions - Mumick, Finkelstein, Pirahesh.. (1990)
(Correct)
Related documents from co-citation: More All
41: Magic Sets and Other Strange Ways to Implement Logic Programs (context) - Bancilhon, Maier et al. - 1986
36: Foundations of Logic Programming (context) - Lloyd - 1987
34: the power of magic
- Beeri, Ramakrishnan - 1987
BibTeX entry: (Update)
Raghu Ramakrishnan. Magic Templates: A Spellbinding Approach to Logic Programs. In Proceedings Fifth International Conference on Logic Programming, 1988. http://citeseer.ist.psu.edu/ramakrishnan88magic.html More
@article{ ramakrishnan91magic,
author = "Raghu Ramakrishnan",
title = "Magic Templates: A Spellbinding Approach To Logic Programs",
journal = "Journal of Logic Programming",
volume = "11",
number = "3&4",
pages = "189-216",
year = "1991",
url = "citeseer.ist.psu.edu/ramakrishnan88magic.html" }
Citations (may not include all citations):
561
Constraint Logic Programming (context) - Jaffar, Lassez - 1987 ACM DBLP
204
Magic Sets and Other Strange Ways to Implement Logic Program.. (context) - Bancilhon, Maier et al. - 1986 DBLP
162
The Semantics of Predicate Logic as a Programming Language (context) - Van Emden, Kowalski - 1976 ACM DBLP
147
An Amateur's Introduction to Recursive Query Processing Stra.. (context) - Bancilhon, Ramakrishnan - 1986 ACM DBLP
121
the Power of Magic
- Beeri, Ramakrishnan - 1987
99
Logic and Data Bases: A Deductive Approach (context) - Gallaire, Minker et al. - 1984
45
Extension Tables: Memo Relations in Logic Programming (context) - Dietrich, Warren - 1987 DBLP
40
Implementation of Logical Query Languages for Databases (context) - Ullman - 1985 ACM DBLP
30
Closures and Fairness in the Semantics of Programming Logic (context) - Lassez, Maher DBLP
30
Performance Evaluation of Data Intensive Logic Programs (context) - Bancilhon, Ramakrishnan - 1988 ACM DBLP
27
On Compiling Queries in Recursive First-Order Data Bases (context) - Henschen, Naqvi - 1984
27
Computing with Logic: Logic Programming with Prolog (context) - Maier, Warren - 1988 ACM
26
The Alexander Method: A Technique for the Processing of Recu.. (context) - Rohmer, Lescoeur et al. - 1986
20
The Generalized Counting Method for Recursive Logic Queries
- Sacca, Zaniolo - 1986 ACM DBLP
19
A Framework for Testing Safety and Effective Computability o.. (context) - Krishnamurthy, Ramakrishnan et al. - 1988 ACM
17
In Foundations of Deductive Databases and Logic Programming (context) - Lassez, Maher et al. - 1988
14
From QSQ Towards QoSaQ: Global Optimization of Recursive Que.. (context) - Vieille - 1988 DBLP
12
Recursive Axioms in Deductive Databases: The Query/Subquery .. (context) - Vieille - 1986 DBLP
9
A Framework for an Efficient Implementation of Deductive Dat.. (context) - Kifer, Lozinskii - 1986
9
the Implementation of a Simple Class of Logic Queries for Da.. (context) - Sacca, Zaniolo - 1986
8
Compiling Separable Recursions (context) - Naughton - 1988 ACM DBLP
8
One-Sided Recursions (context) - Naughton - 1987 ACM DBLP
6
Magic Set Computation of Stratified Databases (context) - Balbin, Port et al. - 1987
6
Sets and Negation in a Logic Database Language (LDL1 (context) - Beeri, Naqvi et al. - 1987
4
The Reduce-Or Process Model for Parallel Evaluation of Logic.. (context) - Kale - 1987 DBLP
4
A Note on the Performance of Rule Based Systems (context) - Bancilhon - 1985
3
Filtering Data Flow in Deductive Databases (context) - Kifer, Lozinskii - 1986 ACM DBLP
2
Implementing Logic Programs As a Database System (context) - Kifer, Lozinskii - 1987 ACM DBLP
1
A Message Passing Framework for Recursive Query Evaluation (context) - Van Gelder - 1986
1
Convergence of Sideways Query Evaluation (context) - Afrati, Papadimitriou et al. - 1986 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.wisc.edu.html): More
Precise Interprocedural Dataflow Analysis with.. - Sagiv, Reps, Horwitz (1995)
(Correct)
A Comparison of Trace-Sampling Techniques for Multi-Megabyte .. - Kessler, HIll, Wood (1994)
(Correct)
Parallel Processing on Dynamic Resources with CARMI - Pruyne (1995)
(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