一种新的XML数据编码方案

A New Coding Scheme for XML

如何对XML文档进行高效的查询,特别是包含查询处理,越来越受到研究界的关注。一种好的XML文档树编码方案可以很好地支持在XML文档上进行包含查询。为了加快XML数据的处理,利用完全二叉树的特性,提出了一种新的编码方案BTC。与区间编码和前缀编码相比,该编码具有简单和长度短的优点,实践证明该编码是有效的。

There has been increasing interest in query processing efficiently for XML, Containment query processing especially. To process XML data more efficiently, a good coding scheme can support containment query processing better. This paper proposes a new coding scheme, called BTC code （Binary Tree Code）, which makes good use of the perfect binary tree characteristics. Compared with the region code and the prefix code, the code is more simple and shorter. In fact, it is efficient.