停止追逐

摘要：

Chase过程是25年前提出的一种算法，用于修复数据库实例中的约束冲突，已成功应用于各种环境，如查询优化、数据交换和数据集成。然而，它的实用性受到这样一个事实的限制：对于任意的约束集，它可能不会终止;更糟糕的是，追逐终止通常是一个不可判定的问题。作为回应，数据库社区在保证任何数据库实例上的追踪终止的约束之上提出了足够的限制。在本文中，我们提出了一个新的充分终止条件，称为归纳限制，它严格推广了以前的条件，但可以有效地检查。此外，我们激励和研究的问题，数据依赖的追逐终止，并作为一个关键的结果，提出了充分的终止条件w.r.t.固定实例。它们严格地比归纳限制更一般，并且可能保证终止，尽管追逐在一般情况下不会终止。

英文摘要：

The chase procedure, an algorithm proposed 25+ years ago to fix constraint violations in database instances, has been successfully applied in a variety of contexts, such as query optimization, data exchange, and data integration. Its practicability, however, is limited by the fact that - for an arbitrary set of constraints - it might not terminate; even worse, chase termination is an undecidable problem in general. In response, the database community has proposed sufficient restrictions on top of the constraints that guarantee chase termination on any database instance. In this paper, we propose a novel sufficient termination condition, called inductive restriction, which strictly generalizes previous conditions, but can be checked as efficiently. Furthermore, we motivate and study the problem of data-dependent chase termination and, as a key result, present sufficient termination conditions w.r.t. fixed instances. They are strictly more general than inductive restriction and might guarantee termination although the chase does not terminate in the general case.

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