REVIEW 2 cited by
The Shapley Value of Tuples in Query Answering
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We investigate the application of the Shapley value to quantifying the contribution of a tuple to a query answer. The Shapley value is a widely known numerical measure in cooperative game theory and in many applications of game theory for assessing the contribution of a player to a coalition game. It has been established already in the 1950s, and is theoretically justified by being the very single wealth-distribution measure that satisfies some natural axioms. While this value has been investigated in several areas, it received little attention in data management. We study this measure in the context of conjunctive and aggregate queries by defining corresponding coalition games. We provide algorithmic and complexity-theoretic results on the computation of Shapley-based contributions to query answers; and for the hard cases we present approximation algorithms.
Forward citations
Cited by 2 Pith papers
-
Uniform Reliability of Self-Join-Free Conjunctive Queries
Uniform reliability (counting satisfying subsets) for self-join-free conjunctive queries is #P-complete for every non-hierarchical query and polynomial-time for every hierarchical query.
-
SHARQ: Explainability Framework for Association Rules on Relational Data
SHARQ defines and efficiently computes a Shapley-value-based contribution score for each element in a set of association rules, enabling element, rule, and attribute level explanations.
Discussion (0). Continue with ORCID to comment.