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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Christoph Standke (RWTH Aachen University)
- 2. Benny Kimelfeld (RelationalAI; Technion)
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 14,015 | Equivalences Among Aggregate Queries with Negation | 2001 | PODS |
| 2 | 7,286 | Efficient Computation of Quantiles over Joins | 2023 | PODS |
| 3 | 8,688 | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms | 2025 | VLDB |
| 4 | 3,918 | From Shapley Value to Model Counting and Back | 2024 | PODS |
| 5 | 2,424 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD |
| 6 | 5,382 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS |
| 7 | 5,657 | When is Shapley Value Computation a Matter of Counting? | 2024 | PODS |
| 8 | 10,174 | A Unifying Algorithm for Hierarchical Queries | 2026 | PODS |
| 9 | 9,809 | Shapley Revisited: Tractable Responsibility Measures for Query Answers | 2025 | PODS |
| 10 | 2,670 | The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries | 2020 | PODS |