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
- 1999
- Venue
- PODS
- Year
- 2026
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,010 | 30.37%
- 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.00057857292 |
| 571 |
The Complexity of Query Reliability |
1998 |
PODS |
0.00019910719 |
| 772 |
Answering Conjunctive Queries under Updates |
2017 |
PODS |
0.00016876498 |
| 1,056 |
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates |
2017 |
SIGMOD |
0.0001441128 |
| 1,119 |
The Complexity of Causality and Responsibility for Query Answers and non-Answers |
2011 |
VLDB |
0.0001386199 |
| 2,402 |
Causality and Explanations in Databases |
2014 |
VLDB |
8.8928361e-05 |
| 2,868 |
Computing the Shapley Value of Facts in Query Answering |
2022 |
SIGMOD |
7.9816425e-05 |
| 3,027 |
The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries |
2020 |
PODS |
7.6842412e-05 |
| 4,591 |
From Shapley Value to Model Counting and Back |
2024 |
PODS |
6.0619399e-05 |
| 4,706 |
Aggregation in Probabilistic Databases via Knowledge Compilation |
2012 |
VLDB |
5.9820914e-05 |
| 4,872 |
Explainable AI: Foundations, Applications, Opportunities for Data Management Research |
2022 |
SIGMOD |
5.8609352e-05 |
| 5,897 |
Answering Aggregate Queries in Data Exchange |
2008 |
PODS |
5.2842198e-05 |
| 5,916 |
Banzhaf Values for Facts in Query Answering |
2024 |
SIGMOD |
5.273953e-05 |
| 5,959 |
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases |
2024 |
PODS |
5.2562342e-05 |
| 5,967 |
Change Propagation Without Joins |
2023 |
VLDB |
5.250976e-05 |
| 6,055 |
When is Shapley Value Computation a Matter of Counting? |
2024 |
PODS |
5.2324399e-05 |
| 6,112 |
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join |
2024 |
PODS |
5.2048658e-05 |
| 6,728 |
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis |
2023 |
PODS |
4.9483326e-05 |
| 8,665 |
Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms |
2025 |
VLDB |
4.471975e-05 |
| 9,640 |
Shapley Revisited: Tractable Responsibility Measures for Query Answers |
2025 |
PODS |
4.3109001e-05 |
| 9,653 |
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration |
2021 |
PODS |
4.3109001e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 13,814 |
Equivalences Among Aggregate Queries with Negation |
2001 |
PODS |
- |
| 8,061 |
Efficient Computation of Quantiles over Joins |
2023 |
PODS |
4.5943269e-05 |
| 4,591 |
From Shapley Value to Model Counting and Back |
2024 |
PODS |
6.0619399e-05 |
| 8,665 |
Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms |
2025 |
VLDB |
4.471975e-05 |
| 2,868 |
Computing the Shapley Value of Facts in Query Answering |
2022 |
SIGMOD |
7.9816425e-05 |
| 5,959 |
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases |
2024 |
PODS |
5.2562342e-05 |
| 6,055 |
When is Shapley Value Computation a Matter of Counting? |
2024 |
PODS |
5.2324399e-05 |
| 10,001 |
A Unifying Algorithm for Hierarchical Queries |
2026 |
PODS |
4.1945683e-05 |
| 9,640 |
Shapley Revisited: Tractable Responsibility Measures for Query Answers |
2025 |
PODS |
4.3109001e-05 |
| 3,027 |
The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries |
2020 |
PODS |
7.6842412e-05 |