评估可扩展性和约束
Assessing Achievability of Queries and Constraints
摘要：
评估和提高数据密集型系统中的数据质量是一项根本性挑战，这导致了许多针对数据转换和清理的应用程序。然而，尽管模式设计、数据清理和数据迁移现在已经被很好地孤立地理解了，但解决这些领域问题的工具之间的相互作用却没有得到太多的关注。我们的重点是确定是否存在数据转换过程的序列的问题，当应用于（未转换的）输入数据，将产生满足执行所讨论的任务所需的条件的数据。我们的目标是开发一个框架来解决这个问题，从关系设置开始。在本文中，我们抽象的数据处理工具的黑盒程序。这个抽象通过过程可能修改数据库的哪些部分的规范来描述过程，以及通过指定应用过程之前和之后数据库所需状态的约束来描述过程。然后，我们继续研究在这种情况下产生的基本算法问题，如了解什么时候可以保证程序序列适用于原始或转换后的数据，当他们成功地改善数据，当知识库可以代表程序的结果。最后，我们转向问题，确定是否应用程序的一系列程序的数据库的结果在指定的查询或约束的属性的满意度。我们表明，这个问题是可判定的程序和属性的一些广泛和现实的类，即使程序被允许改变模式的实例。
英文摘要：
Assessing and improving the quality of data in data-intensive systems are fundamental challenges that have given rise to numerous applications targeting transformation and cleaning of data. However, while schema design, data cleaning, and data migration are nowadays reasonably well understood in isolation, not much attention has been given to the interplay between the tools that address issues in these areas. Our focus is on the problem of determining whether there exist sequences of data-transforming procedures that, when applied to the (untransformed) input data, would yield data satisfying the conditions required for performing the task in question. Our goal is to develop a framework that would address this problem, starting with the relational setting. In this paper we abstract data-processing tools as black-box procedures. This abstraction describes procedures by a specification of which parts of the database might be modified by the procedure, as well as by the constraints that specify the required states of the database before and after applying the procedure. We then proceed to study fundamental algorithmic questions arising in this context, such as understanding when one can guarantee that sequences of procedures apply to original or transformed data, when they succeed at improving the data, and when knowledge bases can represent the outcomes of procedures. Finally, we turn to the problem of determining whether the application of a sequence of procedures to a database results in the satisfaction of properties specified by either queries or constraints. We show that this problem is decidable for some broad and realistic classes of procedures and properties, even when procedures are allowed to alter the schema of instances.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
