CSBTT：一种基于二叉树遍历的 XML 文档编码模式

摘要

XML 文档数据编码模式是 XML 文档查询处理的基础，好的文档编码模式有利于提高文档的查询效率。为了解决 XML 数据查询效率低、支持动态更新等问题。本文在二叉树遍历的编码基础上，引入二叉树的三叉链表存储结构对 XML 文档结点进行编码。该编码利用自然数作为编码序号，因此编码长度较短；引入结点双亲指针，方便结点之间结构关系的判定，结点采用三叉树链式存储，方便文档的更新操作。%XML document data encoding scheme is foundation of XML document query processing. A good document encoding mode can improve the efficiency of XML document query. In order to resolve the inefficiency for XML data query and support dynamic updates, etc, this paper has proposed an improved method to encode XML document nodes. On the basis of the binary traversal, it introduces the trigeminal linked list storage structure of binary tree for encoding. It takes natural number as the serial number of the node encoding, so the encoding length is shorter. Besides, node parent pointer is used for encoding, which will facilitate to determinate the relationship between element nodes. Due to trigeminal linked list storage of nodes, the operation of the document update is more convenient