Advertisement

BBTC: A New Update-Supporting Coding Scheme for XML Documents

  • Jianhua Feng
  • Guoliang Li
  • Lizhu Zhou
  • Na Ta
  • Qian Qian
  • Yuguo Liao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3739)

Abstract

The identification of parent-child or ancestor-descendant relationship between XML elements plays a crucial role in efficient XML query processing. One popular method is to code each node in the XML document tree. However, its main problem is that either lacks the ability to support XML documents update or need huge storage space. This paper proposes a new update-supporting coding scheme based on binary-tree to identify the ancestor-descendant relationship or the parent-child relationship in constant time bound, which also effectively supports XML documents update. To reduce the coding space, we then propose a new storage approach, Blocked Binary-Tree Coding scheme (BBTC), whose average code length reduces to O(log(n)). Our extensive experiments show that BBTC significantly outperforms previous ones.

Keywords

Binary Tree Code Scheme Code Space Sibling Node Insert Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Quass, D., McHugh, J., et al.: The Lore query language for semi-structured data1. Int’l Journal on Digital Libraries 1(1), 68–88 (1997)Google Scholar
  2. 2.
    Deutsch, A., Fernandez, M., Florescu, D., et al.: A query language for XML. In: The 8th Int’l World Wide Web Conf., Toronto (1999)Google Scholar
  3. 3.
    Clark, J., DeRose, S.: XML path language (XPath), W3C Recommendation1 World Wide Web Consortium (1999)Google Scholar
  4. 4.
    Chamberlin, D., Florescu, D., Robie, J., et al.: XQuery: A query language for XML. W3C working draft, WWW (2001)Google Scholar
  5. 5.
    Florescu, D., Kossman, D., et al.: Storing and Querying XML Data using an RDBMS. IEEE Data Engineering Bulletin 22(3) (September 1999)Google Scholar
  6. 6.
    Dietz, P.F.: Maintaining order in a linked list. In: The 14th Annual ACM on Theory of Computing, San Francisco (1982)Google Scholar
  7. 7.
    Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB 2001 (2001)Google Scholar
  8. 8.
    Zhang, C., Naaghton, J., DeWitt, D., et al.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD, California, May 2001, pp. 426–437 (2001)Google Scholar
  9. 9.
    Kha, D.D., Yoshikawa, M., Aemara, S.: An XML indexing structure with relative region coordinate. In: ICDE 2001 (2001)Google Scholar
  10. 10.
    Yan, L., Liang, Z., Wei, W., BaiLe, S.: A New XML Document Coding Scheme. Journal Of Computer Research And development 141(13) (March 2004)Google Scholar
  11. 11.
    Daofeng, L., Xiaofeng, M.: Updating of Extended Preorder Numbering Scheme on XML. Computer Science 30(10) (October 2003)Google Scholar
  12. 12.
    Wirth, N.: Type Extentions. Acm Transaction on Programming Languages and systems 10(2), 204–214 (1988)zbMATHCrossRefGoogle Scholar
  13. 13.
    Tatarinod, I., Stratis, D., Beyer, K., et al.: Storing and querying ordered XML using a relational database system. In: SIGMOD 2002 (2002)Google Scholar
  14. 14.
    Wang, W., Jiang, H., Lu, H., Yu, J.X.: PBiTree coding and efficient processing of containment joins. In: ICDE 2003 (2003)Google Scholar
  15. 15.
  16. 16.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jianhua Feng
    • 1
  • Guoliang Li
    • 1
  • Lizhu Zhou
    • 1
  • Na Ta
    • 1
  • Qian Qian
    • 1
  • Yuguo Liao
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations