Database Paper Browser

Back to papers

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)

Paper ID
1947
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,922 | 24.02%
DOI
10.1145/3695829

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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
31 Provenance Semirings 2007 PODS 0.0007857786
2,907 Convergence of Datalog over (Pre-) Semirings 2022 PODS 7.933806e-05
8,125 The Complexity of Why-Provenance for Datalog Queries 2024 PODS 4.5797807e-05
Previous Page 1 / 1 Next

Semantically Similar Papers