计算机科学 ›› 2015, Vol. 42 ›› Issue (2): 157-160.doi: 10.11896/j.issn.1002-137X.2015.02.034

• 软件与数据库技术 • 上一篇    下一篇

VEMBP:支持更新的XML树编码方法

覃遵跃,蔡国民,张彬连,汤庸   

  1. 吉首大学软件服务外包学院 张家界427000,吉首大学软件服务外包学院 张家界427000,吉首大学软件服务外包学院 张家界427000,华南师范大学计算机学院 广州510631
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家863计划重大项目(2013AA01A212),国家科技支撑计划课题(2012BAH27F05),国家自然科学基金(61363073)资助

VEMBP:A Novel Labeling Method for Updating on XML Data

QIN Zun-yue, CAI Guo-ming, ZHANG Bin-lian and TANG Yong   

  • Online:2018-11-14 Published:2018-11-14

摘要: 对有序XML文档树进行编码,不需要访问XML原始文件就能够实现对XML数据的管理,提高了XML管理系统的效率。针对查询提出的编码方案具有很高的查询性能,但更新效率很低。为提高更新性能而设计的方案存在查询效率低或者编码空间大等问题。为了在提高更新XML文档效率的同时不对查询性能和编码空间产生负面影响,提出了一种新的编码方法VEMBP(Vector Encoding Method Based of Prime),该方法利用向量表示有序XML节点之间的顺序关系,采用素数表示有序XML文档节点之间的结构信息;并设计了一种算法来实现在没有牺牲查询性能的前提下完全避免更新过程中的二次编码和重新计算,降低了更新代价,同时编码空间也得到了控制。实验结果显示,VEMBP具有较好的查询和更新性能。

关键词: XML树,VEMBP编码,查询,更新

Abstract: In order to improve the efficiency of the XML management system,some labeling schemas for the orderly XML tree were put forward,which realize processing of XML data under the condition of no need to access the original XML tree.The proposed labeling schemas for query have higher query performance,but the updating performance is poorer.Some novel labeling schemas designed for updating permance sacrifice query efficiency and possesse larger labeling space.For higher updating efficiency and smaller labeling space at the same time no reducing query efficiency,a novel labeling schema called VEMBP(Vector Encoding Method Based of Prime) was proposed,in which vector indicates order relation and a prime indicates structure relation between nodes in XML tree,and then an algorithm was designed which realizes updating in the cases no sacrificing query efficiency and completely avoiding secondary coding.Meanwhile labeling space is also under control.The experimental results show that VEMBP processes better on updating efficiency without sacrificing query performance.

Key words: XML tree,VEMBP labeling,Query,Updating

[1] Tatarinov S,Viglas D,Beyer K J,et al.Storing and Querying Or-dered XML Using a Relational Database System[C]∥Proc of the ACM SIGMOD 2002.Los Alamitos,CA:IEEE Computer Society,2002:204-215
[2] Li Q,Moon B.Indexing and Querying XML Data for Regular Path Expressions[C]∥Proc of the 27th Intl Conf Very Large Data Bases (VLDB).New York:ACM,2001:361-370
[3] Wu X,Lee M,Hsu W.A Prime Number Labeling Scheme for Dynamic Ordered XML trees[C]∥Proc of the 20th Int Conf Data Engineering (ICDE’04).Los Alamitos,CA:IEEE Computer Society,2004:66-78
[4] O’Neil P,O’Neil E,Pal S,et al.ORDPATHs:Insert-Friendly XML Node Labels[C]∥Proc of ACM SIGMOD 2004.Los Alamitos,CA:IEEE Computer Society,2004:903-908
[5] Xu L,Ling T W,Wu H,et al.DDE:From Dewey to a Fully Dynamic XML Labeling Scheme[C]∥Proc.of the 35th SIGMOD International Conference on Management of Data.2009:719-730
[6] Ko H,Lee S.A Binary String Approach for Updates[J].IEEE Transactions on Knowledge and Data Engineering,2010,22(4):602-608
[7] Jiang Yi,He Xiang-jian,Lin Fan,et al.An Encoding and Labeling Scheme Based on Continued Fraction for Dynamic XML[J].Journal of Software,2011,6(10):2043-2049
[8] Liu Jian,Maa Z M,Li Yan.Efficient labeling scheme for dyna-mic XML trees[J].LNCS,2007,3:515-161
[9] 陈子阳,刘佳,张刘辉,等.DeweyTP:一种面向概率 XML 数据的编码方案[J].通信学报,2013,4(11):26-32
[10] 汪陈应,袁晓洁,王鑫,等.BSC:一种高效的动态XML树编码方案[J].计算机科学,2008,5(3):76-78
[11] 周军锋,孟小峰.XML关键字查询处理研究[J].计算机学报,2012,35(12):2459-2478
[12] Deng Hi-hong,Xiang Yong-qing,Gao Ning.LAF:a new XMLencoding and indexing strategy for keyword-based XML search[J].Concurrency and Computation:Practice and Experience,2013,25(11):1604-1621
[13] 罗道峰,孟小峰,蒋瑜.XML数据扩展前序编码的更新方法[J].软件学报,2005,6(5):810-818
[14] 覃遵跃,黄云,蔡国民,等.支持 XML 插入更新的编码方法[J].计算机应用,2012,32(12):3540-3543

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!