Efficient Query Repair for Aggregate Constraints
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909882504970240 |
|---|---|
| author | Algarni, Shatha Glavic, Boris Lee, Seokki Chapman, Adriane |
| author_facet | Algarni, Shatha Glavic, Boris Lee, Seokki Chapman, Adriane |
| contents | In many real-world scenarios, query results must satisfy domain-specific constraints. For instance, a minimum percentage of interview candidates selected based on their qualifications should be female. These requirements can be expressed as constraints over an arithmetic combination of aggregates evaluated on the result of the query. In this work, we study how to repair a query to fulfill such constraints by modifying the filter predicates of the query. We introduce a novel query repair technique that leverages bounds on sets of candidate solutions and interval arithmetic to efficiently prune the search space. We demonstrate experimentally, that our technique significantly outperforms baselines that consider a single candidate at a time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_00826 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Query Repair for Aggregate Constraints Algarni, Shatha Glavic, Boris Lee, Seokki Chapman, Adriane Databases In many real-world scenarios, query results must satisfy domain-specific constraints. For instance, a minimum percentage of interview candidates selected based on their qualifications should be female. These requirements can be expressed as constraints over an arithmetic combination of aggregates evaluated on the result of the query. In this work, we study how to repair a query to fulfill such constraints by modifying the filter predicates of the query. We introduce a novel query repair technique that leverages bounds on sets of candidate solutions and interval arithmetic to efficiently prune the search space. We demonstrate experimentally, that our technique significantly outperforms baselines that consider a single candidate at a time. |
| title | Efficient Query Repair for Aggregate Constraints |
| topic | Databases |
| url | https://arxiv.org/abs/2511.00826 |