Full Tree-Based Encoding Technique for Dynamic XML Labeling Schemes

Abstract

It is important to design dynamic labeling schemes which can process the updates when nodes are inserted into or deleted from the XML tree. One class of these schemes is based on lexicographical order. Lexicographical order allows dynamic insertions and thus supports updates in dynamic XML. However, these schemes are of inefficient memory usage when initial labeling. They all require creating an encoding table to produce dynamic labels. As the size of the encoding table can be prohibitively large for large XML documents and main memory remains the limiting resource, having encoding algorithms of memory efficiency is desirable. In this paper, we propose an encoding technique which can be applied broadly to lexicographical-based schemes to produce dynamic labels with high memory usage. Meanwhile, since we don’t need the costly table creation, the labeling time of our encoding technique is also efficient. The experimental results confirm that our proposed techniques substantially surpass previous dynamic label schemes.