发表机构
Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG, France; National University of Singapore, Singapore; DI ENS, ENS, CNRS, PSL University, Inria, Paris, France; IPAL, Singapore（格勒诺布尔阿尔卑斯大学; 新加坡国立大学; 巴黎高等师范学院; 国际先进研究院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本研究在带 monus 的交换 semiring 中为含聚合条件（如 HAVING COUNT(*)）的查询定义了溯源语义，无需额外算子，并证明其与无聚合重写的标准溯源一致，且在 ProvSQL 中实现，性能可行。
AI 中文摘要
Semiring 框架及其扩展构成了数据库查询溯源追踪的丰富理论结果和实现的基础。许多真实世界的查询使用聚合以及针对聚合值的条件。通过引入 semimodule 元素作为聚合值，以及将聚合值之间的形式化比较作为元组注释，已提出了对此类查询的支持，这使该方法超出了标准 semiring 框架。在这项工作中，我们展示了如何在任意带 monus 的交换 semiring（或 m-semiring）中，无需额外算子，为这类查询的溯源引入一种语义。该语义被证明在可吸收且 times 在 monus 上分配的 semiring 中，与 HAVING COUNT(*) 查询的无聚合自连接重写的标准溯源一致。我们为此语义推导了算法，并在 ProvSQL 系统中实现了它们，在真实世界数据集上对概率查询评估展现了可行的性能。
英文摘要
The semiring framework and its extensions form the basis of a rich collection of theoretical results and implementations for provenance tracking of database queries. Many real-world queries use aggregation and conditions on the aggregate values. Support for such queries has been proposed by introducing semimodule elements as aggregate values and formal comparisons between aggregate values as tuple annotations, which takes the approach outside the standard semiring framework. In this work, we show how to introduce a semantics for the provenance of such queries in arbitrary commutative semirings with monus (or m-semirings), without the need for additional operators. This semantics is shown to agree with the standard provenance of the aggregation-free self-join rewriting of HAVING COUNT(*) queries in semirings that are absorptive and where times distributes over monus. We derive algorithms for this semantics and implement them within the ProvSQL system, with viable performance on a real-world dataset for probabilistic query evaluation.
Comments53 pages. Implementation: https://provsql.org/; Lean formalization: https://provsql.org/lean-docs/Provenance.html
