计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (4): 121-123.DOI: 10.3778/j.issn.1002-8331.2011.04.033

• 数据库、信号与信息处理 • 上一篇    下一篇

一种新的XML文档更新计算

覃遵跃1,汤 庸2,徐洪智1,卓月明3   

  1. 1.吉首大学 信息管理与工程学院,湖南 张家界 427000
    2.中山大学 计算机科学系,广州 510275
    3.吉首大学 物理科学与信息工程学院,湖南 吉首 416000
  • 收稿日期:2009-04-02 修回日期:2009-06-01 出版日期:2011-02-01 发布日期:2011-02-01
  • 通讯作者: 覃遵跃

Novel updating computation for XML document

QIN Zunyue1,TANG Yong2,XU Hongzhi1,ZHUO Yueming3   

  1. 1.College of Information Management & Engineering,Jishou University,Zhangjiajie,Hunan 427000,China
    2.Department of Computer Science,Sun Yat-sen University,Guangzhou 510275,China
    3.College of Physics Science & Information Engineering,Jishou University,Jishou,Hunan 416000,China
  • Received:2009-04-02 Revised:2009-06-01 Online:2011-02-01 Published:2011-02-01
  • Contact: QIN Zunyue

摘要: 当对XML文档进行插入操作时面临调整编码问题,目前提出的很多编码方案不能同时很好地支持XPath查询和XML文档更新。在分析现有编码方案的基础上,提出了基于完全树的编码方案,该编码方案采用序号冗余和虚拟节点两种冗余方式,不仅支持XPath的查询,而且能有效降低因插入节点需要对XML文档进行二次编码率。实验结果表明,完全树以及相应编码有效提高了XML文档插入节点的效率。

关键词: XML技术, OMPP编码, 更新

Abstract: The problem of adjusting coding is encountered while inserting a node in XML document.At present coding scheme proposed can’t support both XPath and updating XML document properly.The paper puts forward coding scheme based on complete tree after analyzing existing scheme,the scheme not only supports XPath but also decreases efficiently second-coding rate when a new node is inserted to XML document because the scheme makes use of redundancy number and virtual nodes.The experiments show that the method raises the efficiency of inserting a node in XML document.

Key words: XML technology, OMPP coding, updating

中图分类号: