论文部分内容阅读
对于函数依赖、多值依赖都建立了正确(sound)、完备的(complete)公理系统.对于嵌入型多值依赖的正确、完备的公理系统问题,Sagir、Walacka 已证明它没有有限公理系.但嵌入型多值依赖作为特殊情况包含的型板依赖被定义之后,它的成员问题已有半判定方法.特别是对嵌入型多值依赖集合作一些限制后,它的成员问题可解性已被提出.本文对 Chase过程作了更改后,形成 N-Chase 过程,并利用它对一种嵌入型多值依赖集证明了其成员问题的可解性.
For function dependencies and multi-valued dependencies, a sound and complete axiom system is established. For the correct and complete axiom system problems with embedded multi-valued dependencies, Sagir and Walacka have proved that they have no finite axiom systems, but they are embedded. After the multi-valued dependency is defined as a special case containing the plate-type dependency, its member problem has already been a semi-decision method. Especially after some limitations of the embedded multi-valued dependency set cooperation, the solvability of its membership problem has been proposed. In this paper, the Chase process is modified to form the N-Chase process, and it is used to prove the solvability of its membership problem for an embedded multivalued dependency set.