通过论证方法计算函数依赖与包含依赖下的修复
Computing Repairs Under Functional and Inclusion Dependencies via Argumentation
AI总结:
本文揭示数据库修复与论证框架扩展之间的对应关系,证明函数依赖下修复对应朴素、首选和稳定扩展,包含依赖需预处理,混合依赖下仅首选语义适用,并给出相关决策问题的复杂性结果。
摘要:
我们发现,为函数依赖和包含依赖集合寻找子集极大修复,与在论证框架(AFs)中计算扩展之间存在联系。我们通过用AFs模拟这些问题实例,研究了修复存在性以及判断给定元组是否属于某个(或每个)修复的复杂性。我们证明,函数依赖下的子集极大修复对应于朴素扩展,并且这些扩展在所得AFs中也与首选扩展和稳定扩展一致。对于包含依赖,需要对所得AFs进行预处理步骤,才能使扩展与修复一致。同时允许两种类型的依赖会破坏扩展之间的这种关系,只有首选语义能够刻画修复。最后,我们证明当同时允许函数依赖和包含依赖时,上述决策问题的复杂性分别为NP完全和Pi_2^P完全。
英文摘要:
We discover a connection between finding subset-maximal repairs for sets of functional and inclusion dependencies, and computing extensions within argumentation frameworks (AFs). We study the complexity of the existence of a repair and deciding whether a given tuple belongs to some (or every) repair, by simulating the instances of these problems via AFs. We prove that subset-maximal repairs under functional dependencies correspond to the naive extensions, which also coincide with the preferred and stable extensions in the resulting AFs. For inclusion dependencies, one needs a pre-processing step on the resulting AFs in order for the extensions to coincide. Allowing both types of dependencies breaks this relationship between extensions, and only preferred semantics captures the repairs. Finally, we establish that the complexities of the above decision problems are NP-complete and Pi_2^P-complete, when both functional and inclusion dependencies are allowed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。