Constraints and Redundancy in Datalog
Summary: Introduces two redundancy notions for Datalog—reachability (rules/predicates not on any derivation tree for the query) and irrelevance (based on minimal derivation trees)—and provides algorithms that detect them and build redundancy-free rule‑goal trees. Handles constraint literals, tightly pushes constraints to EDB under stated assumptions, and relates redundancy elimination to uniform-equivalence minimization and magic-set/style constraint-pushing. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alon Levy
- 2. Yehoshua Sagiv
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 618 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00018990567 |
| 937 | Queries Independent of Updates | 1993 | VLDB | 0.00015194231 |
| 976 | Answering Queries Using Limited External Query Processors | 1996 | PODS | 0.00014877501 |
| 1,303 | Query Optimization by Predicate Move-Around | 1994 | VLDB | 0.00012692678 |
| 2,836 | Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions | 1993 | PODS | 8.0466188e-05 |
| 2,887 | Semantic Query Optimization in Datalog Programs (Extended Abstract) | 1995 | PODS | 7.9640219e-05 |
| 3,196 | The LyriC Language: Querying Constraint Objects | 1995 | SIGMOD | 7.4048386e-05 |
| 4,793 | Toward Practical Constraint Databases | 1993 | VLDB | 5.9107617e-05 |
| 8,012 | Compiling Query Constraints | 1994 | PODS | 4.6021663e-05 |
| 12,791 | Static Analysis of Intensional Databases in U-Datalog | 1996 | PODS | 4.1905499e-05 |
| 12,838 | Universal Finiteness and Satisfiability | 1994 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 173 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00038731283 |
| 209 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.00034147258 |
| 1,687 | Automata Theory for Database Theoreticians | 1989 | PODS | 0.0001090256 |
| 3,110 | Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract) | 1990 | PODS | 7.5488545e-05 |
| 3,284 | Magic Conditions | 1990 | PODS | 7.2738706e-05 |
| 3,440 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0897313e-05 |
| 7,018 | Hard problems for simple logic programs | 1990 | SIGMOD | 4.8555836e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,887 | Semantic Query Optimization in Datalog Programs (Extended Abstract) | 1995 | PODS | 7.9640219e-05 |
| 9,385 | Exploiting the Power of Equality-generating Dependencies in Ontological Reasoning | 2022 | VLDB | 4.342951e-05 |
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |
| 2,544 | Aggregation and Relevance in Deductive Databases | 1991 | VLDB | 8.5646035e-05 |
| 12,915 | Detecting Redundant Tuples During Query Evaluation | 1991 | PODS | 4.1905499e-05 |
| 1,489 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011687823 |
| 12,914 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS | 4.1905499e-05 |
| 14,182 | The Complexity of Reusing and Modifying Rulebases | 1992 | PODS | - |
| 2,836 | Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions | 1993 | PODS | 8.0466188e-05 |
| 209 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.00034147258 |