使用元组删除进行最小更改完整性维护
Minimal-Change Integrity Maintenance Using Tuple Deletions
摘要：
本文研究了关系数据库中完整性约束下的最小变化完整性维护问题。我们假设完整性恢复操作仅限于元组删除。我们确定了两个基本的计算问题：修复检查（数据库实例是给定数据库的修复？）以及一致的查询答案（元组是给定数据库的每次修复中给定查询的答案吗？）。我们研究了这两个问题的计算复杂性，划定了易处理和难处理之间的边界。我们考虑拒绝约束，一般功能和包含依赖，以及关键字和外键约束。我们的研究结果揭示了最小变化的完整性维护的计算可行性。易于处理的案例应导致实际执行。棘手的结果突出了任何完整性实施机制的固有局限性，例如，触发器或引用约束操作，作为执行最小更改完整性维护的一种方式。
英文摘要：
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are limited to tuple deletions. We identify two basic computational issues: repair checking (is a database instance a repair of a given database?) and consistent query answers (is a tuple an answer to a given query in every repair of a given database?). We study the computational complexity of both problems, delineating the boundary between the tractable and the intractable. We consider denial constraints, general functional and inclusion dependencies, as well as key and foreign key constraints. Our results shed light on the computational feasibility of minimal-change integrity maintenance. The tractable cases should lead to practical implementations. The intractability results highlight the inherent limitations of any integrity enforcement mechanism, e.g., triggers or referential constraint actions, as a way of performing minimal-change integrity maintenance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
