An Efficient Encoding and Labeling Scheme for Dynamic XML Data

  • Xu Juan
  • Li Zhanhuai
  • Wang Yanlong
  • Yao Rugui
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4653)


It is important to process the updates when nodes are inserted into or deleted from the XML tree. However, all the existing labeling schemes have high update cost. In this paper, we innovatively introduce a concept of Forbidden Code Segment (FCS), and then propose a novel and efficient encoding approach, called Extended Lexicographical Order encoding based on Forbidden Code Segment (FCS-ELO Encoding), whose codes are more compact than CDBS and QED codes. The most important characteristic is that our FCS-ELO labeling scheme can gracefully handle arbitrary update patterns and completely avoid re-labeling in XML updates, which is not at the sacrifice of query performance. We deliver the detailed theoretic analyses and experiments to show that, the proposed labeling scheme is superior to all the existing dynamic labeling schemes to process updates in terms of the incremental label size and the time for updating.


Forbidden Code Segment (FCSLexicographical Order labeling scheme re-labeling updates 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E., Yergeau, F.: Extensible Markup Language (XML) 1.0, 3rd edn., W3C recommendation (2000)Google Scholar
  2. 2.
    Abiteboul, S., Kaplan, H., Milo, T.: Compact Labeling Schemes for Ancestor Queries. In: Proc. of SODA, pp. 547–556 (2001)Google Scholar
  3. 3.
    Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. In: Proc. of SIGMOD, pp. 253–262 (1989)Google Scholar
  4. 4.
    Wu, X., Lee, M.L., Hsu, W.: A Prime Number Labeling Scheme for Dynamic Ordered XML Trees. In: Proc. of ICDE, pp. 66–78 (2004)Google Scholar
  5. 5.
    Amagasa, T., Yoshikawa, M., Uemura, S.: QRS: A Robust Numbering Scheme for XML Documents. In: Proc. of ICDE, pp. 705–707 (2003)Google Scholar
  6. 6.
    Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proc. of VLDB, pp. 361–370 (2001)Google Scholar
  7. 7.
    Zhang, C., Naughton, J., DeWitt, D., et al.: On Supporting Containment Queries in Relational Database Management Systems. In: Proc. of ACM SIGMOD, pp. 425–436. ACM Press, New York (2001)CrossRefGoogle Scholar
  8. 8.
    Tatarinov, Viglas, S., Beyer, K.S., Shanmugasundaram, J., et al.: Storing and Querying Ordered XML Using A Relational Database System. In: Proc. of SIGMOD, pp. 204–215 (2002)Google Scholar
  9. 9.
    O’Neil, P.E., O’Neil, E.J., Pal, S., Cseri, I., et al.: ORDPATHs: Insert-Friendly XML Node Labels. In: Proc. of SIGMOD, pp. 903–908 (2004)Google Scholar
  10. 10.
    Li, C., Ling, T.W.: QED: A Novel Quaternary Encoding to Completely Avoid Re-labeling in XML Updates. In: Proc. of CIKM, pp. 501–508 (2005)Google Scholar
  11. 11.
    Li, C., Ling, T.W., Hu, M.: Efficient Processing of Updates in Dynamic XML Data. In: Proc. of ICDE, pp. 13–22 (2006)Google Scholar
  12. 12.
    NIAGARA Experimental Data. Available at:

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Xu Juan
    • 1
  • Li Zhanhuai
    • 1
  • Wang Yanlong
    • 1
  • Yao Rugui
    • 1
  1. 1.School of Computer Science and Technology, Northwestern Polytechnical University, Xi’an 710072China

Personalised recommendations