首页 | 本学科首页   官方微博 | 高级检索  
     

XML弱函数依赖及其推理规则
引用本文:苏召,刘国华.XML弱函数依赖及其推理规则[J].计算机应用,2007,27(5):1228-1231.
作者姓名:苏召  刘国华
作者单位:燕山大学信息科学与工程学院,河北秦皇岛066004
基金项目:教育部科学技术研究重点项目 , 河北省自然科学基金
摘    要:XML函数依赖问题是进行XML数据库后续研究的基础。首先基于M.Arenas等人给定的XML中DTD和XML树的定义,提出空值、不完全树元组、数据值偏序、最小扩展树等概念,在此基础上,给出弱函数依赖及其满足性的定义;其次研究了XML弱函数依赖的逻辑蕴含问题,提出一组适合XML空值模型的函数依赖推理规则集;最后给出推理规则集的正确性和完备性证明。

关 键 词:XML  空值  不完全树元组  弱函数依赖  完备性
文章编号:1001-9081(2007)05-1228-04
收稿时间:2006-11-20
修稿时间:2006-11-20

Weak functional dependencies and inference rules for XML
SU Zhao,LIU Guo-hua.Weak functional dependencies and inference rules for XML[J].journal of Computer Applications,2007,27(5):1228-1231.
Authors:SU Zhao  LIU Guo-hua
Affiliation:College of Information Science and Engineering, Yanshan University, Qinhuangdao Hebei 066004, China
Abstract: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.
Keywords:Extensible Markup Language(XML)  null value  tree tuple  weak functional dependency  completeness
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号