An efficient numbering scheme and query algorithms for XML

  • Authors:
  • Zhongming Han;Jiajin Le;Niya Fu

  • Affiliations:
  • Beijing Technology and Business University, Beijing 100037, PR China/ College of Computer Science and Technology, Donghua University, 1882 Yananxi West Road, Shanghai 200051, PR China.;College of Computer Science and Technology, Donghua University, 1882 Yananxi West Road, Shanghai 200051, PR China.;College of Computer Science and Technology, Donghua University, 1882 Yananxi West Road, Shanghai 200051, PR China

  • Venue:
  • International Journal of Computational Science and Engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.