摘要
对有序XML文档进行编码,可以不用访问XML数据文件就能够实现对XML数据的处理。目前提出的编码方案在支持查询XML数据方面取得了较好的效果,针对已有编码方案在插入更新过程中存在查询性能或者更新性能偏低等问题,提出了一种新的支持插入更新的编码方案——EDL,EDL对前缀编码进行了扩展,利用数值表达节点的初始顺序关系,利用二进制字符串(BS)来支持更新计算。EDL在未降低查询性能的前提下,完全避免了插入更新后对其他节点进行重新编码,高效实现了XML文档的插入更新计算。实验结果表明EDL优于同类型的支持更新的编码方案。
XML data can be processed by labeling ordered documents without accessing data files.With the current labeling schemes,better progress has been made in supporting XML data queries.Now,a new labeling scheme,EDL（Extended Dewey Labeling）,was proposed to deal with lower query and update performance,as well as other problems in insertions.EDL extended the prefix labeling.Values were used to express the initial order in nodes,while BS（Binary String） to support updates calculations.With no sacrifice of query performance,relabeling other nodes after insertions was completely avoided,and the update performance was greatly improved.The experimental results show that EDL works better than other similar labeling schemes.
出处
《计算机应用》
CSCD
北大核心
2012年第12期3540-3543,3547,共5页
journal of Computer Applications
基金
国家自然科学基金资助项目(61173018)
湖南省教育厅优秀青年项目(11B102)
吉首大学校级重点科研项目(Jdzdw12010)
