More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets
Summary: Subsumptive tabling enables high reuse in top-down evaluation, beating magic-sets bottom-up for Datalog queries. Subsumptive demand transformation makes bottom-up mimic top-down; subsumption optimization boosts reuse, validated on ontology benchmarks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,259 | On the Optimization of Recursive Relational Queries: Application to Graph Queries | 2020 | SIGMOD | 5.5984356e-05 |
| 6,650 | Efficient Identification of Implicit Facts in Incomplete OWL2-EL Knowledge Bases | 2014 | VLDB | 4.9763184e-05 |
| 9,714 | Materializing Knowledge Bases via Trigger Graphs | 2021 | VLDB | 4.299267e-05 |
| 11,053 | Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers | 2024 | VLDB | 4.1945683e-05 |
| 11,248 | Scalable Reasoning on Document Stores via Instance-Aware Query Rewriting | 2023 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 200 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.00035012858 |
| 287 | Declarative Information Extraction Using Datalog with Embedded Extraction Predicates | 2007 | VLDB | 0.00028971272 |
| 1,122 | Bottom-Up Beats Top-Down For Datalog | 1989 | PODS | 0.0001385042 |
| 2,877 | Semantic Query Optimization in Datalog Programs (Extended Abstract) | 1995 | PODS | 7.9715251e-05 |
| 6,957 | Adding Magic to an Optimising Datalog Compiler | 2008 | SIGMOD | 4.8859842e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,122 | Bottom-Up Beats Top-Down For Datalog | 1989 | PODS | 0.0001385042 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |
| 6,365 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS | 5.0945408e-05 |
| 5,992 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2415551e-05 |
| 6,957 | Adding Magic to an Optimising Datalog Compiler | 2008 | SIGMOD | 4.8859842e-05 |
| 12,904 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS | 4.1945683e-05 |
| 8,937 | Efficiently Ordering Subgoals with Access Constraints [Extended Abstract] | 2006 | PODS | 4.427232e-05 |
| 5,628 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.4030815e-05 |
| 2,720 | A General Datalog-Based Framework for Tractable Query Answering over Ontologies | 2009 | PODS | 8.2367715e-05 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |