DBScholar

Back to papers

The Complexity of Why-Provenance for Datalog Queries

Summary: Data- and complexity-theoretic analysis of why-provenance for Datalog queries, filling a literature gap with a sharp dichotomy. Recursive (even linear) Datalog why-provenance is intractable; non-recursive cases are highly tractable. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h03d3481651aa86dc
Venue
PODS
Year
2024
Pagerank
5.3641687e-05
Overall Rank
8,275 | 44.37%
DOI
10.1145/3651146

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{calautti_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{The Complexity of Why-Provenance for Datalog Queries}},
        url = {https://dl.acm.org/doi/10.1145/3651146},
        doi = {10.1145/3651146},
        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 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
10,149 Datalog with First-Class Facts 2025 VLDB 5.0715586e-05
11,083 Circuits and Formulas for Datalog over Semirings 2025 PODS 4.9793485e-05
11,490 Below and Above Why-Provenance for Datalog Queries 2024 PODS 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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.00059752575
794 On the Complexity of Bounded-Variable Queries 1995 PODS 0.00013941847
2,418 The Semiring Framework for Database Provenance 2017 PODS 8.4928222e-05
2,630 Convergence of Datalog over (Pre-) Semirings 2022 PODS 8.2027684e-05
Previous Page 1 / 1 Next

Semantically Similar Papers