Abstract: Dewey code is a kind of important coding scheme of XML document, it is an important preprocessing step in XML keyword search. This paper proposes two algorithms for Dewey code of XML document, that is the recursive algorithm based on DOM and the event generation algorithm based on SAX, and compares the running time, memory consumption of two algorithms. Experimental result shows that the SAX event generation algorithm is with higher speed and lower memory consumption for very large XML document.

Key words: XML document, Dewey encoding, DOM

摘要： Dewey编码是一种重要的XML文档编码方式，是对XML文档进行关键字检索等操作的重要预处理步骤。提出2种XML文档Dewey编码的生成算法：基于DOM的递归算法和基于SAX的事件生成算法，并比较2种算法的执行时间和内存使用率。实验结果证明，对于超大XML文档，采用基于SAX的事件生成算法具有较快的生成速度和较低的内存使用率。

关键词: XML文档, Dewey编码, 文档对象模型

CLC Number: 

• TP311