DBScholar

Back to papers

Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries

Summary: Identifies, per aggregation, maximal classes of hierarchical CQs where computing the Shapley value is polynomial-time for every local value function, and proves #P-hardness outside those classes. Maps max/min/count-distinct→all-hierarchical, average/quantile→q-hierarchical, and defines a stricter “has-duplicates” hierarchy. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
hf4017ab2869b4087
Venue
PODS
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,399 | 30.09%
DOI
10.1145/3767720

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{standke_pods26,
        address = {New York, NY, USA},
        series = {{PODS} '26},
        title = {{Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries}},
        url = {https://dl.acm.org/doi/10.1145/3767720},
        doi = {10.1145/3767720},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Standke, Christoph and Kimelfeld, Benny},
        year = {2026}
}

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 21 of 21 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
51 Efficient Query Evaluation on Probabilistic Databases 2004 VLDB 0.00042936299
578 The Complexity of Causality and Responsibility for Query Answers and non-Answers 2011 VLDB 0.00016096504
637 Answering Conjunctive Queries under Updates 2017 PODS 0.00015341557
658 The Complexity of Query Reliability 1998 PODS 0.00015051203
812 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013729015
1,981 Causality and Explanations in Databases 2014 VLDB 9.2586863e-05
2,217 Computing the Shapley Value of Facts in Query Answering 2022 SIGMOD 8.8172185e-05
2,722 The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries 2020 PODS 8.0955983e-05
4,002 From Shapley Value to Model Counting and Back 2024 PODS 6.8607198e-05
4,176 Aggregation in Probabilistic Databases via Knowledge Compilation 2012 VLDB 6.7573044e-05
5,057 Change Propagation Without Joins 2023 VLDB 6.2927647e-05
5,178 Explainable AI: Foundations, Applications, Opportunities for Data Management Research 2022 SIGMOD 6.2411759e-05
5,514 Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases 2024 PODS 6.0978288e-05
5,750 Answering Aggregate Queries in Data Exchange 2008 PODS 6.0073031e-05
5,791 When is Shapley Value Computation a Matter of Counting? 2024 PODS 5.9937717e-05
5,793 Banzhaf Values for Facts in Query Answering 2024 SIGMOD 5.9930101e-05
5,965 A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join 2024 PODS 5.9325836e-05
5,978 Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis 2023 PODS 5.9287388e-05
8,855 Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms 2025 VLDB 5.2638827e-05
9,997 Shapley Revisited: Tractable Responsibility Measures for Query Answers 2025 PODS 5.0979044e-05
10,007 Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration 2021 PODS 5.0979044e-05
Previous Page 1 / 1 Next

Semantically Similar Papers