Abstract
It is important to design dynamic labeling schemes which can process the updates when nodes are inserted into or deleted from the XML tree. One class of these schemes is based on lexicographical order. Lexicographical order allows dynamic insertions and thus supports updates in dynamic XML. However, these schemes are of inefficient memory usage when initial labeling. They all require creating an encoding table to produce dynamic labels. As the size of the encoding table can be prohibitively large for large XML documents and main memory remains the limiting resource, having encoding algorithms of memory efficiency is desirable. In this paper, we propose an encoding technique which can be applied broadly to lexicographical-based schemes to produce dynamic labels with high memory usage. Meanwhile, since we don’t need the costly table creation, the labeling time of our encoding technique is also efficient. The experimental results confirm that our proposed techniques substantially surpass previous dynamic label schemes.
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
Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD (2001)
Tatarinov, I., Viglas, S., Beyer, K.S., Shanmugasundaram, J., Shekita, E.J., Zhang, C.: Storing and Querying Ordered XML Using a Relational Database System. In: SIGMOD (2002)
Wu, X., Lee, M., Hsu, W.: A prime number labeling scheme for dynamic order XML tree. In: ICDE (2004)
O’Neil, P., O’Neil, E., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: Insert-friendly XML Node Labels. In: SIGMOD (2004)
Xu, L., Bao, Z., Ling, T.-W.: A Dynamic Labeling Scheme Using Vectors. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 130–140. Springer, Heidelberg (2007)
Xu, L., Ling, T.W., Wu, H., Bao, Z.: DDE: from Dewey to a fully dynamic XML labeling scheme. In: SIGMOD (2009)
Li, C., Ling, T.W., Hu, M.: Efficient Processing of Updates in Dynamic XML Data. In: ICDE (2006)
Li, C., Ling, T.W., Hu, M.: Efficient Updates in Dynamic XML Data: from Binary String to Quaternary String. In: VLDB J. (2008)
Li, C., Ling, T.W.: QED: A Novel Quaternary Encoding to Completely Avoid Re-labeling in XML Updates. In: CIKM (2005)
Li, C., Ling, T.-W., Hu, M.: Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes. In: Lee, M.L., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 659–673. Springer, Heidelberg (2006)
Paul, F.: Dietz. Maintaining order in a linked list. In: Annual ACM Symposium on Theory of Computing (1982)
Cohen, E., Kaplan, H., Milo, T.: Labeling Dynamic XML Trees. In: SPDS (2002)
Xu, L., Ling, T.W., Bao, Z., Wu, H.: Efficient Label Encoding for Range-Based Dynamic XML Labeling Schemes. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5981, pp. 262–276. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhuang, C., Feng, S. (2012). Full Tree-Based Encoding Technique for Dynamic XML Labeling Schemes. In: Liddle, S.W., Schewe, KD., Tjoa, A.M., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32600-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-32600-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32599-1
Online ISBN: 978-3-642-32600-4
eBook Packages: Computer ScienceComputer Science (R0)