基于扩展Dewey编码的XML文档更新计算  

Updating computing for XML document based on extended Dewey coding

作　　者：覃遵跃[1] 汤庸[2] 徐洪智[1] 

机构地区：[1]吉首大学信息管理与工程学院,湖南张家界427000 [2]中山大学计算机科学系,广东广州510275

出　　处：《计算机工程与设计》2009年第10期2583-2585,2589,共4页Computer Engineering and Design

摘　　要：针对在进行XML文档插入、删除等更新时因需要频繁调整相应的子树编码而导致更新低效问题。分析了低效的原因,提出了一种扩展的Dewey编码方案。该编码方案对Dewey编码的连续性进行扩展,使兄弟节点之间的编码不再连续,为插入新节点准备冗余空间。在此基础上,设计了支持该扩展编码方案的XML文档节点插入算法和分裂算法。实验结果表明,提出的扩展Dewey编码方案有效地实现了XML文档的更新计算。The low efficient problem of updating is encountered because of adjusting frequently the coding of subtree when some nodes of XML document are inserted or deleted. The cause of low efficiency is analyzed, then an extended Dewey coding is put forward. This coding scheme extending the continuity of Dewey coding and leading to the uncontinuous coding between sibling node is prepared for inserting new nodes. On that basis, an algorithm of inserting and splitting node supported by this coding scheme in XML document is designed. The experimental result shows, the proposed extended Dewey coding scheme achieves the updating computing of XML document effectively.

关 键 词：XML技术 扩展Dewey编码 文档修改 插入 兄弟距离 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]