Computing Range Consistent Answers to Aggregation Queries via Rewriting

Aziz Amezian El Khalfioui, Jef Wijsen
{"title":"Computing Range Consistent Answers to Aggregation Queries via Rewriting","authors":"Aziz Amezian El Khalfioui, Jef Wijsen","doi":"arxiv-2409.01648","DOIUrl":null,"url":null,"abstract":"We consider the problem of answering conjunctive queries with aggregation on\ndatabase instances that may violate primary key constraints. In SQL, these\nqueries follow the SELECT-FROM-WHERE-GROUP BY format, where the WHERE-clause\ninvolves a conjunction of equalities, and the SELECT-clause can incorporate\naggregate operators like MAX, MIN, SUM, AVG, or COUNT. Repairs of a database\ninstance are defined as inclusion-maximal subsets that satisfy all primary\nkeys. For a given query, our primary objective is to identify repairs that\nyield the lowest aggregated value among all possible repairs. We particularly\ninvestigate queries for which this lowest aggregated value can be determined\nthrough a rewriting in first-order logic with aggregate operators.","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.01648","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider the problem of answering conjunctive queries with aggregation on database instances that may violate primary key constraints. In SQL, these queries follow the SELECT-FROM-WHERE-GROUP BY format, where the WHERE-clause involves a conjunction of equalities, and the SELECT-clause can incorporate aggregate operators like MAX, MIN, SUM, AVG, or COUNT. Repairs of a database instance are defined as inclusion-maximal subsets that satisfy all primary keys. For a given query, our primary objective is to identify repairs that yield the lowest aggregated value among all possible repairs. We particularly investigate queries for which this lowest aggregated value can be determined through a rewriting in first-order logic with aggregate operators.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过重写计算聚合查询的范围一致答案
我们考虑的问题是,如何回答对可能违反主键约束的数据库实例进行聚合的连接查询。在 SQL 中,这些查询遵循 SELECT-FROM-WHERE-GROUP BY 格式,其中 WHERE-clause涉及等式连接,而 SELECT-clause可以包含诸如 MAX、MIN、SUM、AVG 或 COUNT 等聚合运算符。数据库实例的修复被定义为满足所有主键的最大包含子集。对于给定的查询,我们的主要目标是找出在所有可能的修复中产生最低聚合值的修复。我们特别研究了可以通过使用聚合运算符的一阶逻辑重写来确定最低聚合值的查询。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Development of Data Evaluation Benchmark for Data Wrangling Recommendation System Messy Code Makes Managing ML Pipelines Difficult? Just Let LLMs Rewrite the Code! Fast and Adaptive Bulk Loading of Multidimensional Points Matrix Profile for Anomaly Detection on Multidimensional Time Series Extending predictive process monitoring for collaborative processes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1