At the moment, most of the index structures and query algorithms for XML documents are constructed on a region-based numbering scheme. However, this numbering scheme suffers from some drawbacks. In this paper, a novel and efficient numbering scheme is presented, which combines the label path information and data path information, and it can efficiently support all kinds of queries. Properties of this numbering scheme are discussed in detail. Query algorithms based on index structure, named HiD, are introduced. Finally, comprehensive experiments are conducted to demonstrate the efficiency of our query algorithm.
['Zhongming Han', 'Jiajin Le', 'Niya Fu']
An efficient numbering scheme and query algorithms for XML