XML数据扩展前序编码的更新方法  

Updating of Extended Preorder Numbering Scheme on XML

作　　者：罗道锋[1] 孟小峰[1] 蒋瑜[1] 

机构地区：[1]中国人民大学信息学院,北京100872

出　　处：《软件学报》2005年第5期810-818,共9页Journal of Software

基　　金：国家自然科学基金;国家高技术研究发展计划(863);国家教育部科学技术研究重点项目~~

摘　　要：大部分XML查询技术都是基于某种对XML树的编码方法.对XML树的编码,是指按照某种规则对XML树的每一个结点分配唯一的编码,目的是通过任意两个结点的编码,能够直接判断两个结点之间是否具有祖先后代关系.最常用的编码方法是区域编码方法(region based numbering scheme).然而,XML数据也会面临插入删除等更新问题.数据一旦更新,区域编码也要作相应的调整,才能保证基于这个编码的各种索引和查询算法的正确性.在编码的更新方面,目前研究得还不多.主要研究区域编码的更新问题,采用预留编码空间的方法,针对不同特征的XML数据和应用环境提出了一整套预留算法和编码更新算法,并做了大量的实验,检验这些算法的有效性.Most of the XML query processing strategies are based on some numbering schemes. Nodes on the XML tree will be assigned a unique code by the numbering scheme, and ancestor-descendant relationship could be directly told through the codes. The most famous numbering scheme is Region Based Numbering Scheme. However, XML data will be updated. Once the data is updated, the region code should be adjusted to keep the indexing and query processing techniques working. Unfortunately, few studies have been reported on the issue of the numbering scheme. This paper focuses on this issue, proposing a series of space preserving and updating algorithms. Extensive experiments are conducted to test the effectiveness of the algorithms.

关 键 词：可扩展标记语言 编码方案 区域编码 更新 预留 

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