New XML document coding scheme based on complete binary tree
一种基于二叉树的Native XML数据库文档编码机制

In this paper, a new coding scheme was proposed, which was based on the sequence of its complete binary tree. The scheme is easy to realize and only one positive integer is needed to express the position of the node in XML tree. The time-bounding of identifying the ancestor-descendant relationships is only O(log n). It also supports XML document update. In the scheme, the length of the code is short.