XML不完全信息树下的完全函数依赖弱保持

Weak XML complete functional dependency holding under incomplete information tree

在DTD模型下,在XML信息树中引入了不完全信息,形成一棵不完全信息树。文中以不完全信息树为基础定义了树中节点之间的关系:节点值等价和节点值相容。并在此基础上定义了函数依赖的强保持条件、完全函数依赖弱保持。给出了给定函数依赖集判断完全函数依赖弱保持的算法及满足完全函数依赖弱保持时,当树确定化后成为完全信息树下函数依赖的可能性的证明。

Incomplete information is introduced to XML tree, under incomplete information tree, the paper defines node value equivalence, consistent node value. On the basis of these concepts, strong XML functional dependency holding and weak XML complete functional dependency holding are defined, and it presents algorithms of weather satisfying weak XML Complete functional dependency holding.