论文标题
一致的查询回答在元组损坏语义下的表达限制
Consistent Query Answering for Expressive Constraints under Tuple-Deletion Semantics
论文作者
论文摘要
我们在关系数据库中研究一致的查询答案。我们考虑一类表达的模式约束，概括了元组产生的依赖性和相等性的依赖性。我们确定了一致的查询回答和维修检查的复杂性，该检查在元组损坏语义下，对上述约束语言的不同片段进行了检查。特别是，我们确定了以上问题是可行的甚至一阶重写的新的约束子类。
We study consistent query answering in relational databases. We consider an expressive class of schema constraints that generalizes both tuple-generating dependencies and equality-generating dependencies. We establish the complexity of consistent query answering and repair checking under tuple-deletion semantics for different fragments of the above constraint language. In particular, we identify new subclasses of constraints in which the above problems are tractable or even first-order rewritable.
