标题： 高效聚合约束查询修复 显示英文标题

标题： Efficient Query Repair for Aggregate Constraints

摘要： 在许多现实场景中，查询结果必须满足特定领域的约束。 例如，根据资格选择的面试候选人中，女性应占一定最低比例。 这些要求可以表示为对查询结果上计算的聚合值的算术组合的约束。 在本工作中，我们研究如何通过修改查询的过滤谓词来修复查询以满足此类约束。 我们引入了一种新颖的查询修复技术，该技术利用候选解集合的边界和区间算术来高效地剪枝搜索空间。 我们通过实验表明，我们的技术显著优于每次只考虑一个候选解的基线方法。 显示英文摘要

摘要： 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.