XML弱函数依赖及其推理规则  

Weak functional dependencies and inference rules for XML

作　　者：苏召[1] 刘国华[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《计算机应用》2007年第5期1228-1231,共4页journal of Computer Applications

基　　金：教育部科学技术研究重点项目(205014);河北省教育厅自然科学指令计划资助项目(2005102)

摘　　要：XML函数依赖问题是进行XML数据库后续研究的基础。首先基于M.Arenas等人给定的XML中DTD和XML树的定义,提出空值、不完全树元组、数据值偏序、最小扩展树等概念,在此基础上,给出弱函数依赖及其满足性的定义;其次研究了XML弱函数依赖的逻辑蕴含问题,提出一组适合XML空值模型的函数依赖推理规则集;最后给出推理规则集的正确性和完备性证明。The problem of functional dependencies for Extensible Markup Language （XML） is the foundation of further research for XML database. In this paper, first, based on the definitions of Document Type Definition （DTD） and XML tree given by M. Arenas et al. , concepts of null value, incomplete tree tuple, data value partial order and minimal extended tree were proposed. Second, the definition of weak functional dependency and its satisfaction ＇were given. Then the problem of logical implication for weak functional dependencies was studied, and a set of inference rules for XML were presented. Finally. the correctness and completeness of the set were proved.

关 键 词：XML 空值 不完全树元组 弱函数依赖 完备性 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]