A Dynamic Labeling Scheme Using Vectors

The labeling problem of dynamic XML documents has received increasing research attention. When XML documents are subject to insertions and deletions of nodes, it is important to design a labeling scheme that efficiently facilitates updates as well as processing of XML queries. This paper proposes a novel encoding scheme, vector encoding which is orthogonal to existing labeling schemes and can completely avoid re-labeling. Extensive experiments show that our vector encoding outperforms existing labeling schemes on both label updates and query processing especially in the case of skewed updates. Besides, it has the nice property of being conceptually easy to understand through its graphical representation.

[1]  David J. DeWitt,et al.  On supporting containment queries in relational database management systems , 2001, SIGMOD '01.

[2]  Stephen Alstrup,et al.  Compact Labeling Scheme for Ancestor Queries , 2006, SIAM J. Comput..

[3]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[4]  Roy Goldman,et al.  Lore: a database management system for semistructured data , 1997, SGMD.

[5]  Tok Wang Ling,et al.  QED: a novel quaternary encoding to completely avoid re-labeling in XML updates , 2005, CIKM '05.

[6]  X. Wu,et al.  A prime number labeling scheme for dynamic ordered XML trees , 2004, Proceedings. 20th International Conference on Data Engineering.

[7]  Toshiyuki Amagasa,et al.  QRS: a robust numbering scheme for XML documents , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).