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
- 2000
- Venue
- PODS
- Year
- 2026
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,010 | 30.44%
- DOI
-
10.1145/3767720
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
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 |
| 74 |
Efficient Query Evaluation on Probabilistic Databases |
2004 |
VLDB |
0.00057797415 |
| 572 |
The Complexity of Query Reliability |
1998 |
PODS |
0.00019888988 |
| 770 |
Answering Conjunctive Queries under Updates |
2017 |
PODS |
0.0001686092 |
| 1,054 |
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates |
2017 |
SIGMOD |
0.00014397587 |
| 1,119 |
The Complexity of Causality and Responsibility for Query Answers and non-Answers |
2011 |
VLDB |
0.00013851012 |
| 2,400 |
Causality and Explanations in Databases |
2014 |
VLDB |
8.884178e-05 |
| 2,876 |
Computing the Shapley Value of Facts in Query Answering |
2022 |
SIGMOD |
7.9739469e-05 |
| 3,030 |
The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries |
2020 |
PODS |
7.676832e-05 |
| 4,591 |
From Shapley Value to Model Counting and Back |
2024 |
PODS |
6.056109e-05 |
| 4,708 |
Aggregation in Probabilistic Databases via Knowledge Compilation |
2012 |
VLDB |
5.9763416e-05 |
| 4,875 |
Explainable AI: Foundations, Applications, Opportunities for Data Management Research |
2022 |
SIGMOD |
5.8552996e-05 |
| 5,901 |
Answering Aggregate Queries in Data Exchange |
2008 |
PODS |
5.2791434e-05 |
| 5,918 |
Banzhaf Values for Facts in Query Answering |
2024 |
SIGMOD |
5.2688869e-05 |
| 5,960 |
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases |
2024 |
PODS |
5.251188e-05 |
| 5,973 |
Change Propagation Without Joins |
2023 |
VLDB |
5.2459364e-05 |
| 6,058 |
When is Shapley Value Computation a Matter of Counting? |
2024 |
PODS |
5.2274142e-05 |
| 6,114 |
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join |
2024 |
PODS |
5.1998701e-05 |
| 6,732 |
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis |
2023 |
PODS |
4.9435849e-05 |
| 8,663 |
Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms |
2025 |
VLDB |
4.4676883e-05 |
| 9,639 |
Shapley Revisited: Tractable Responsibility Measures for Query Answers |
2025 |
PODS |
4.3067693e-05 |
| 9,654 |
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration |
2021 |
PODS |
4.3067693e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 13,828 |
Equivalences Among Aggregate Queries with Negation |
2001 |
PODS |
- |
| 8,065 |
Efficient Computation of Quantiles over Joins |
2023 |
PODS |
4.5899218e-05 |
| 8,663 |
Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms |
2025 |
VLDB |
4.4676883e-05 |
| 4,591 |
From Shapley Value to Model Counting and Back |
2024 |
PODS |
6.056109e-05 |
| 5,960 |
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases |
2024 |
PODS |
5.251188e-05 |
| 2,876 |
Computing the Shapley Value of Facts in Query Answering |
2022 |
SIGMOD |
7.9739469e-05 |
| 6,058 |
When is Shapley Value Computation a Matter of Counting? |
2024 |
PODS |
5.2274142e-05 |
| 10,000 |
A Unifying Algorithm for Hierarchical Queries |
2026 |
PODS |
4.1905499e-05 |
| 9,639 |
Shapley Revisited: Tractable Responsibility Measures for Query Answers |
2025 |
PODS |
4.3067693e-05 |
| 3,030 |
The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries |
2020 |
PODS |
7.676832e-05 |