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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Deutsch, A., Fernandez, M., Florescu, D., et al.: A query language for XML. In: The 8th Int’l World Wide Web Conf., Toronto (1999)
Clark, J., DeRose, S.: XML path language (XPath), W3C Recommendation1 World Wide Web Consortium (1999)
Chamberlin, D., Florescu, D., Robie, J., et al.: XQuery: A query language for XML. W3C working draft, WWW (2001)
Florescu, D., Kossman, D., et al.: Storing and Querying XML Data using an RDBMS. IEEE Data Engineering Bulletin 22(3) (September 1999)
Dietz, P.F.: Maintaining order in a linked list. In: The 14th Annual ACM on Theory of Computing, San Francisco (1982)
Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB 2001 (2001)
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)
Kha, D.D., Yoshikawa, M., Aemara, S.: An XML indexing structure with relative region coordinate. In: ICDE 2001 (2001)
Yan, L., Liang, Z., Wei, W., BaiLe, S.: A New XML Document Coding Scheme. Journal Of Computer Research And development 141(13) (March 2004)
Daofeng, L., Xiaofeng, M.: Updating of Extended Preorder Numbering Scheme on XML. Computer Science 30(10) (October 2003)
Wirth, N.: Type Extentions. Acm Transaction on Programming Languages and systems 10(2), 204–214 (1988)
Tatarinod, I., Stratis, D., Beyer, K., et al.: Storing and querying ordered XML using a relational database system. In: SIGMOD 2002 (2002)
Wang, W., Jiang, H., Lu, H., Yu, J.X.: PBiTree coding and efficient processing of containment joins. In: ICDE 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, J., Li, G., Zhou, L., Ta, N., Qian, Q., Liao, Y. (2005). BBTC: A New Update-Supporting Coding Scheme for XML Documents. In: Fan, W., Wu, Z., Yang, J. (eds) Advances in Web-Age Information Management. WAIM 2005. Lecture Notes in Computer Science, vol 3739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563952_4
Download citation
DOI: https://doi.org/10.1007/11563952_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29227-2
Online ISBN: 978-3-540-32087-6
eBook Packages: Computer ScienceComputer Science (R0)