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,960 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS | 5.251188e-05 |
| 8,663 | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms | 2025 | VLDB | 4.4676883e-05 |
| 9,639 | Shapley Revisited: Tractable Responsibility Measures for Query Answers | 2025 | PODS | 4.3067693e-05 |
| 10,010 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 4.1905499e-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 |
|---|---|---|---|---|
| 8,148 | Evaluating Top-k Queries with Inconsistency Degrees | 2020 | VLDB | 4.5717374e-05 |
| 10,000 | A Unifying Algorithm for Hierarchical Queries | 2026 | PODS | 4.1905499e-05 |
| 8,065 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5899218e-05 |
| 8,850 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4324268e-05 |
| 5,960 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS | 5.251188e-05 |
| 3,702 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8251643e-05 |
| 10,007 | Query Answering Under Volume-Based Diversity Functions | 2026 | PODS | 4.1905499e-05 |
| 10,010 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 4.1905499e-05 |
| 2,876 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD | 7.9739469e-05 |
| 8,663 | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms | 2025 | VLDB | 4.4676883e-05 |