摘要
提出了一组适合于M．Arenas等人给定的XFD的推理规则并证明了推理规则集的正确性和完备性。在此基础上,研究了XFD的逻辑蕴含问题,提出了求解路径闭包算法和成员籍算法。
With the increasing relevance of the data-centric aspects of XML, it is pertinent to study functional dependencies in the context of XML, which will form the basis for further studies into XML keys and normalization. In this paper, the XFD definition and relative notations proposed by M. Arenas et al. are introduced. Based on the definition of XFD, the inference rules for XML and logical implication is studied, and a set of inference rules, a path closure algorithm and membership algorithm are presented, and inference rules＇s correctness and completeness is proved.
出处
《燕山大学学报》
CAS
2006年第5期421-425,共5页
Journal of Yanshan University
基金
教育部科学技术研究重点项目(No.205014)
河北省教育厅自然科学指令计划(No.2005102)
