Abstract: eXtensible Markup Language(XML) coding method based on vector is simple but it can not reuse the deleted code, and it impacts the update efficiency for XML. An improved algorithm is proposed to calculate the intermediate vector with smallest size, which only takes polynomial time. Based on Stern-Brocot tree and modeling the problem as an integer programming problem, this algorithm improves the calculation of the intermediate vector and optimize the bulk allocation, so the vector encoding is more effective on update. Experimental result shows that the improved coding method can use the deleted code effectively and it is more adapted for XML update.

Key words: dynamic eXtensible Markup Language(XML), vector coding, Dynamic Dewey(DDE) coding, middle vector, XML coding

摘要： 基于向量的动态可扩展标记语言(XML)编码方法计算简单，但不能对已删编码进行重用，严重影响XML更新效率。为此，利用Stern-Brocot树对中间向量计算进行改进，提出一种求解最短位长中间向量的多项式时间算法，对批量分配进行优化，从而提高向量编码的更新性能。实验结果证明改进的编码方法能较好地重用已删编码，适用于XML的频繁更新。

关键词: 动态可扩展标记语言, 向量编码, DDE编码, 中间向量, XML编码

CLC Number: 

• TP311