arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.11160cs.DB
收藏

通过条件式语法理解语法

Understanding Queries by Conditional Instances

Amir Gilad, Zhengjie Miao, Sudeepa Roy, Jun Yang

摘要:

理解复杂查询的一种有效方法是观察它如何对数据实例进行操作。然而,特定的数据库实例对于这样的观察并不理想:它们通常包括大量多余的细节,这些细节不仅与理解查询无关,而且还会导致认知过载;并且一个特定的数据库可能不够。给定一个关系查询,是否有可能提供一个简单而通用的“代表性”实例,(1)说明如何满足查询,(2)通过抽象掉不必要的细节,以相同的方式总结所有满足查询的特定实例?此外,是否有可能找到这样的代表性实例的集合,这些代表性实例一起完全表征可以满足查询的所有可能方式?本文采取初步步骤回答这些问题。我们设计这些代表性实例的样子,定义它们代表什么,并形式化它们以“所有可能的方式”满足查询的含义。“我们认为,这个问题是不可判定的一般域关系演算查询,并开发实用的算法来计算最小的收集这样的实例受到其他约束。我们实验评估我们的方法的效率,并显示其有效性,帮助用户调试关系查询,通过用户研究。

英文摘要:

A powerful way to understand a complex query is by observing how it operates on data instances. However, specific database instances are not ideal for such observations: they often include large amounts of superfluous details that are not only irrelevant to understanding the query but also cause cognitive overload; and one specific database may not be enough. Given a relational query, is it possible to provide a simple and generic "representative" instance that (1) illustrates how the query can be satisfied, (2) summarizes all specific instances that would satisfy the query in the same way by abstracting away unnecessary details? Furthermore, is it possible to find a collection of such representative instances that together completely characterize all possible ways in which the query can be satisfied? This paper takes initial steps towards answering these questions. We design what these representative instances look like, define what they stand for, and formalize what it means for them to satisfy a query in "all possible ways." We argue that this problem is undecidable for general domain relational calculus queries, and develop practical algorithms for computing a minimum collection of such instances subject to other constraints. We evaluate the efficiency of our approach experimentally, and show its effectiveness in helping users debug relational queries through a user study.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑