Abstract
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.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E., Yergeau, F.: Extensible Markup Language (XML) 1.0, 3rd edn., W3C recommendation (2000)
Abiteboul, S., Kaplan, H., Milo, T.: Compact Labeling Schemes for Ancestor Queries. In: Proc. of SODA, pp. 547–556 (2001)
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)
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)
Amagasa, T., Yoshikawa, M., Uemura, S.: QRS: A Robust Numbering Scheme for XML Documents. In: Proc. of ICDE, pp. 705–707 (2003)
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proc. of VLDB, pp. 361–370 (2001)
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)
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)
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)
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)
Li, C., Ling, T.W., Hu, M.: Efficient Processing of Updates in Dynamic XML Data. In: Proc. of ICDE, pp. 13–22 (2006)
NIAGARA Experimental Data. Available at: http://www.cs.wisc.edu/niagara/data
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juan, X., Zhanhuai, L., Yanlong, W., Rugui, Y. (2007). An Efficient Encoding and Labeling Scheme for Dynamic XML Data. In: Wagner, R., Revell, N., Pernul, G. (eds) Database and Expert Systems Applications. DEXA 2007. Lecture Notes in Computer Science, vol 4653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74469-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-74469-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74467-2
Online ISBN: 978-3-540-74469-6
eBook Packages: Computer ScienceComputer Science (R0)