Banzhaf Values for Facts in Query Answering
Summary: Banzhaf values as a principled explanation metric for fact contributions to query answers; introduces exact, anytime-approximate, and top-k/ranking algorithms via lineage compilation and DP on Boolean functions. Also proves a tractability dichotomy for Banzhaf ranking (hierarchical vs. non-hierarchical queries) and shows large speedups over prior methods. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Omer Abramovich
- 2. Daniel Deutch
- 3. Nave Frost
- 4. Ahmet Kara
- 5. Dan Olteanu
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,959 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS | 5.2562342e-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 |
| 10,010 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 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 | Pagerank |
|---|---|---|---|---|
| 7,692 | Processing Top-k Join Queries | 2010 | VLDB | 4.6761366e-05 |
| 8,145 | Evaluating Top-k Queries with Inconsistency Degrees | 2020 | VLDB | 4.5761263e-05 |
| 10,001 | A Unifying Algorithm for Hierarchical Queries | 2026 | PODS | 4.1945683e-05 |
| 8,061 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5943269e-05 |
| 8,851 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4363908e-05 |
| 5,959 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS | 5.2562342e-05 |
| 3,715 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8220943e-05 |
| 10,010 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 4.1945683e-05 |
| 2,868 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD | 7.9816425e-05 |
| 8,665 | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms | 2025 | VLDB | 4.471975e-05 |