Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.16923 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912442776289280 |
|---|---|
| author | Abramovich, Omer Deutch, Daniel Frost, Nave Kara, Ahmet Olteanu, Dan |
| author_facet | Abramovich, Omer Deutch, Daniel Frost, Nave Kara, Ahmet Olteanu, Dan |
| contents | In this paper, we introduce a novel approach to computing the contribution of input tuples to the result of the query, quantified by the Banzhaf and Shapley values. In contrast to prior algorithmic work that focuses on Select-Project-Join-Union queries, ours is the first practical approach for queries with aggregates. It relies on two novel optimizations that are essential for its practicality and significantly improve the runtime performance already for queries without aggregates. The first optimization exploits the observation that many input tuples have the same contribution to the query result, so it is enough to compute the contribution of one of them. The second optimization uses the gradient of the query lineage to compute the contributions of all tuples with the same complexity as for one of them. Experiments with a million instances over 3 databases show that our approach achieves up to 3 orders of magnitude runtime improvements over the state-of-the-art for queries without aggregates, and that it is practical for aggregate queries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_16923 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms Abramovich, Omer Deutch, Daniel Frost, Nave Kara, Ahmet Olteanu, Dan Databases In this paper, we introduce a novel approach to computing the contribution of input tuples to the result of the query, quantified by the Banzhaf and Shapley values. In contrast to prior algorithmic work that focuses on Select-Project-Join-Union queries, ours is the first practical approach for queries with aggregates. It relies on two novel optimizations that are essential for its practicality and significantly improve the runtime performance already for queries without aggregates. The first optimization exploits the observation that many input tuples have the same contribution to the query result, so it is enough to compute the contribution of one of them. The second optimization uses the gradient of the query lineage to compute the contributions of all tuples with the same complexity as for one of them. Experiments with a million instances over 3 databases show that our approach achieves up to 3 orders of magnitude runtime improvements over the state-of-the-art for queries without aggregates, and that it is practical for aggregate queries. |
| title | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms |
| topic | Databases |
| url | https://arxiv.org/abs/2506.16923 |