Alon Levy Dept. of Computer Science Stanford University Stanford, CA 94305...  Home/Search
Context Related
| stanford.edu/pub/KSL_...KSL9226.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Two types of redundancies in datalog programs are considered. Redundancy based on reachability eliminates rules and predicates that do not participate in any derivation tree of a fact for the query predicate. Redundancy based on irrelevance is similar, but considers only minimal derivation trees, that is, derivation trees having no pair of identical atoms, such that one is an ancestor of the other. Algorithms for detecting these redundancies are given, including the case of programs with... (Update)
Context of citations to this paper: More
.... work on deductive databases (Mumick et al. 1990, Srivastava and Ramakrishnan, 1992, Kemp and Stuckey, 1993, Kemp et al. 1989, Levy and Sagiv, 1992) concentrate on optimizing by repositioning constraints and assume the implementation of selection, projection and join and...
.... was used to model infinite sequences of time points [KSW90, BNW91, NS92] More recent works on deductive databases [MFPR90, SR92, KS92, LS92] considered manipulation and repositioning of constraints for optimizing recursion. Algorithms for constraint algebra operators such as...
Cited by: More
Speeding Up Inferences Using Relevance - Reasoning Formalism And (Correct)
Mediated Query Processing Over Autonomous Data Sources - Yerneni (2001) (Correct)
Inference of Termination Conditions for Numerical Loops - Serebrenik (2001) (Correct)
Active bibliography (related documents): More All
0.3: Constraint Databases: A Survey - Revesz (1998) (Correct)
0.3: On the Equivalence of Recursive and Nonrecursive Datalog Programs - Chaudhuri (1992) (Correct)
0.2: The Complexity Of Querying Indefinite Information: Defined.. - van der Meyden (1992) (Correct)
Similar documents based on text: More All
0.2: A Proof-Theoretic Approach to Irrelevance: Foundations and.. - Levy, Fikes, Sagiv (1994) (Correct)
0.2: Exploiting Irrelevance Reasoning to Guide Problem Solving - Levy, Sagiv (1993) (Correct)
0.1: On Removing Multiple Redundancies in Combinational Circuits - Chang, Cheng, Yeh (Correct)
Related documents from co-citation: More All
13: Pushing Constraints Selections - Srivastava, Ramakrishnan - 1992
11: Ullman J. D.: Principles of Database and Knowledge-Base Systems, Volumes 1 and 2. Computer Science Press, 1988. This article was processed using the L scaled 913a T E X macro package with LLNCS style
9: Magic Conditions - Mumick, Finkelstein et al. - 1990
BibTeX entry: (Update)
Levy, A. Y., and Sagiv, Y. (1992). Constraints and redundancy in Datalog. In Proceedings of the Eleventh ACM Symposium on Principles of Database Systems, San Diego, CA. http://citeseer.ist.psu.edu/299717.html More
@inproceedings{ levy92constraints,
author = "Alon Levy and Yehoshua Sagiv",
title = "Constraints and redundancy in datalog",
pages = "67--80",
year = "1992",
url = "citeseer.ist.psu.edu/299717.html" }
Citations (may not include all citations):315 Constraint query languages - Kanellakis, Kuper et al. - 1990
96 On conjunctive queries containing inequalities (context) - Klug - 1988
64 Optimizing datalog programs (context) - Sagiv
25 Inference of inequality constraints in logic programs (context) - Brodsky - 1991
11 Propagating constraints in recursive deductive databases (context) - Balbin, Kemp et al. - 1989
7 on Principles of Database Systems (context) - Mumick, Finkelstein et al. - 1990
6 Recursive queries and context-free graph grammars (context) - Courcelle - 1991
1 of database queries. Proc. Int. Conf. on Data and Knowledge .. (context) - Kifer - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (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