arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.6682cs.DB
收藏

追逐的解剖

Anatomy of the chase

Gosta Grahne, Adrian Onet

摘要:

由于Chase过程在数据集成、数据交换、查询优化、对等数据交换和数据通信等方面的有用性,最近围绕Chase过程进行了大量的研究活动。随着一些研究小组和作者对追逐进行了研究和进一步发展,出现了许多追逐的变体,并获得了相关的结果。由于该地区的异质性,往往难以核实每项成果的范围。在本文中,我们仔细研究了最近的发展,并提供了额外的结果。我们的分析使我们能够创建一个分类的追逐变化和他们满足的属性。关于追逐的两个最核心的问题是终止,以及发现保证追逐终止的依赖集的受限类。搜索受限类的动机是最近的一个结果,该结果表明,确定具有给定依赖集的追逐是否会在给定实例上终止是不可判定的。这里有一个小的不协调,因为一直在寻求依赖集的类,保证在所有实例上的追逐的终止,即使后一个问题并不知道是不可判定的。我们在本文中解决的不和谐表明,确定是否与一组给定的依赖关系的追逐终止在所有的实例是核心完成。我们的约简也给了我们前面提到的依赖实例的RE完备性结果作为副产品。对于其中一个限制类,分层集依赖,我们提供了新的复杂性测试问题的结果是否一组给定的依赖属于it.These结果纠正了一些以前的索赔,已经发生在文献中。

英文摘要:

A lot of research activity has recently taken place around the chase procedure, due to its usefulness in data integration, data exchange, query optimization, peer data exchange and data correspondence, to mention a few. As the chase has been investigated and further developed by a number of research groups and authors, many variants of the chase have emerged and associated results obtained. Due to the heterogeneous nature of the area it is frequently difficult to verify the scope of each result. In this paper we take closer look at recent developments, and provide additional results. Our analysis allows us create a taxonomy of the chase variations and the properties they satisfy. Two of the most central problems regarding the chase is termination, and discovery of restricted classes of sets of dependencies that guarantee termination of the chase. The search for the restricted classes has been motivated by a fairly recent result that shows that it is undecidable to determine whether the chase with a given dependency set will terminate on a given instance. There is a small dissonance here, since the quest has been for classes of sets of dependencies guaranteeing termination of the chase on all instances, even though the latter problem was not known to be undecidable. We resolve the dissonance in this paper by showing that determining whether the chase with a given set of dependencies terminates on all instances is coRE-complete. Our reduction also gives us the aforementioned instance-dependent RE-completeness result as a byproduct. For one of the restricted classes, the stratified sets dependencies, we provide new complexity results for the problem of testing whether a given set of dependencies belongs to it. These results rectify some previous claims that have occurred in the literature.

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

↑