Below and Above Why-Provenance for Datalog Queries
Summary: Why-provenance for Datalog queries is NP-complete in data complexity. The authors prove that why-minimal-provenance yields tractable data complexity, and that why-multiplicity-provenance remains tractable except for one surprising PSPACE-complete case. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Marco Calautti (University of Milan)
- 2. Ester Livshits (University of Edinburgh)
- 3. Andreas Pieris (University of Cyprus; University of Edinburgh)
- 4. Markus Schneider (King's College London)
BibTeX Citation
@inproceedings{calautti_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Below and Above Why-Provenance for Datalog Queries}},
url = {https://dl.acm.org/doi/10.1145/3695829},
doi = {10.1145/3695829},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Calautti, Marco and Livshits, Ester and Pieris, Andreas and Schneider, Markus},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 17 | Provenance Semirings | 2007 | PODS | 0.00059843817 |
| 2,600 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 8.3571843e-05 |
| 8,100 | The Complexity of Why-Provenance for Datalog Queries | 2024 | PODS | 5.4872887e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,008 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD |
| 2 | 605 | The Complexity of Causality and Responsibility for Query Answers and non-Answers | 2011 | VLDB |
| 3 | 6,221 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS |
| 4 | 13,099 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS |
| 5 | 4,747 | High-Level Why-Not Explanations using Ontologies | 2015 | PODS |
| 6 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 7 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 8 | 6,358 | On Provenance Minimization | 2011 | PODS |
| 9 | 6,587 | Selective Provenance for Datalog Programs Using Top-K Queries | 2015 | VLDB |
| 10 | 8,100 | The Complexity of Why-Provenance for Datalog Queries | 2024 | PODS |