Computing the Shapley Value of Facts in Query Answering
Summary: Two methods to compute Shapley values for relational queries, via probabilistic query evaluation. Exact Shapley via Boolean provenance and Knowledge Compilation; a faster CNF-based heuristic is proposed; experiments on TPC-H/IMDB confirm practicality. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Daniel Deutch (Tel Aviv University)
- 2. Nave Frost (Tel Aviv University)
- 3. Benny Kimelfeld (Technion 6 Israel Institute of Technology)
- 4. Mika ebl Monet (CNRS; INRIA; University of Lille; École Centrale de Lille)
BibTeX Citation
@inproceedings{deutch_sigmod22,
title = {{Computing the Shapley Value of Facts in Query Answering}},
author = {Deutch, Daniel and Frost, Nave and Kimelfeld, Benny and Monet, Mika ebl},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3517912},
url = {https://dl.acm.org/doi/10.1145/3514221.3517912},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 19 of 19 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 15 | How Good Are Query Optimizers, Really? | 2016 | VLDB | 0.00061463175 |
| 17 | Provenance Semirings | 2007 | PODS | 0.00059660827 |
| 581 | The Complexity of Causality and Responsibility for Query Answers and non-Answers | 2011 | VLDB | 0.00016042765 |
| 1,079 | Curated Databases | 2008 | PODS | 0.00012117197 |
| 1,822 | ProvSQL: Provenance and Probability Management in PostgreSQL | 2018 | VLDB | 9.5464187e-05 |
| 1,989 | Causality and Explanations in Databases | 2014 | VLDB | 9.2277193e-05 |
| 2,233 | Explaining Query Answers with Explanation-Ready Databases | 2016 | VLDB | 8.7844607e-05 |
| 2,427 | The Semiring Framework for Database Provenance | 2017 | PODS | 8.4673732e-05 |
| 2,734 | The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries | 2020 | PODS | 8.0650095e-05 |
| 7,591 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 5.4736931e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,448 | Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games | 2024 | SIGMOD |
| 2 | 5,809 | Banzhaf Values for Facts in Query Answering | 2024 | SIGMOD |
| 3 | 8,882 | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms | 2025 | VLDB |
| 4 | 5,806 | When is Shapley Value Computation a Matter of Counting? | 2024 | PODS |
| 5 | 2,734 | The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries | 2020 | PODS |
| 6 | 5,078 | ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values | 2022 | SIGMOD |
| 7 | 10,477 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS |
| 8 | 10,038 | Shapley Revisited: Tractable Responsibility Measures for Query Answers | 2025 | PODS |
| 9 | 4,020 | From Shapley Value to Model Counting and Back | 2024 | PODS |
| 10 | 5,538 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS |