This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Binary String Approach for Updates in Dynamic Ordered XML Data
April 2010 (vol. 22 no. 4)
pp. 602-607
Hye-Kyeong Ko, Korea University, Seoul
SangKeun Lee, Korea University, Seoul
To facilitate XML query processing, several labeling schemes have been proposed, in which the ancestor-descendant and parent-child relationships in XML queries can be quickly determined without accessing the original XML file. However, all of these existing schemes have to relabel the existing nodes or recalculate certain values when order-sensitive updates cause insertions, thus causing the label update cost to be high. In this paper, we propose a novel labeling scheme, called IBSL (Improved Binary String Labeling), which supports order-sensitive updates without relabeling or recalculation. In addition, we reuse the deleted labels at the same position in the XML tree. The conducted experimental results show that IBSL efficiently processes order-sensitive queries and leaf node/subtree updates.

[1] S. Abiteboul, H. Kaplan, and T. Milo, "Compact Labeling Schemes for Ancestor Queries," Proc. Symp. Discrete Algorithms (SODA), pp. 547-556, 2001.
[2] R. Agrawal, A. Borgida, and H.V. Jadadish, "Efficient Management of Transitive Relationships in Large Data and Knowledge Bases," Proc. ACM SIGMOD, pp. 253-262, 1989.
[3] T. Amagasa, M. Yoshikawa, and S. Uemura, "QRS: A Robust Numbering Scheme for XML Documents," Proc. Int'l Conf. Data Eng. (ICDE), pp. 705-707, 2003.
[4] A. Berglund, S. Boag, D. Chamberlin, M.F. Fernández, M. Kay, J. Robie, and J. Simeon, "XML Path Language (XPath) 2.0," W3C Working Draft, 2005.
[5] S. Boag, D. Chamberlin, M.F. Fernández, D. Florescu, J. Robie, and J. Simeon, "XQuery 1.0," W3C Working Draft, 2005.
[6] E. Cohen, H. Kaplan, and T. Milo, "Labeling Dynamic XML Trees," Proc. Symp. Principles of Database Systems (PODS), pp. 271-281, 2002.
[7] A. Fomichev, M. Grinev, and S. Kuznetsov, "Sedna: A Native XML DBMS," Proc. Int'l Conf. Current Trends in Theory and Practice of Computer Science (SOFSEM), pp. 272-281, 2006.
[8] H.-K. Ko and S. Lee, "An Efficient Scheme to Completely Avoid Re-Labeling in XML Updates," Proc. Int'l Conf. Web Information Systems Eng. (WISE), pp. 259-264, 2006.
[9] Q. Li and B. Moon, "Indexing and Querying XML Data for Regular Path Expressions," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 361-370, 2001.
[10] K. Kobayashi et al., "VLEI Code: An Efficient Labeling Method for Handling XML Documents in an RDB," Proc. Int'l Conf. Data Eng. (ICDE), pp. 386-387, 2005.
[11] C. Li and T.W. Ling, "QED: A Novel Quaternary Encoding to Completely Avoid Re-Labeling in XML Updates," Proc. Int'l Conf. Information and Knowledge Management (CIKM), pp. 501-508, 2005.
[12] C. Li, T.W. Ling, and M. Hu, "Efficient Processing of Updates in Dynamic XML Data," Proc. Int'l Conf. Data Eng. (ICDE), pp. 13-22, 2006.
[13] C. Li, T.W. Ling, and M. Hu, "Efficient Updates in Dynamic XML Data: From Binary String to Quaternary String," Very Large Data Bases J., vol. 17, no. 3, pp. 573-601, 2008.
[14] C. Li, T.W. Ling, and M. Hu, "Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes," Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA), pp. 659-673, 2006.
[15] J. Lu, T.W. Ling, C.-Y. Chan, and T. Chen, "From Region Encoding to Extended Dewey: On Efficient Processing of XML Twig Pattern Matching," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 193-204, 2005.
[16] J. McHugh, S. Abiteboul, R. Goldman, D. Quass, and J. Widom, "Lore: A Database Management System for Semistructured Data," SIGMOD Record, vol. 2, no. 3, pp. 54-66, 1997.
[17] "Niagara Project," http://www.cs.wisc.eduniagara/, 2009.
[18] P. O'Neil, E. O'Neil, S. Pal, I. Cseri, and G. Schaller, "ORDPATHs: Insert-Friendly XML Node Labels," Proc. ACM SIGMOD, pp. 903-908, 2004.
[19] A. Silberstein et al., "Boxes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data," Proc. Int'l Conf. Data Eng. (ICDE), pp. 285-296, 2005.
[20] S. Tatarinov, D. Viglas, K. Beyer, J. Shanmugasundaram, E. Shekita, and C. Zhang, "Storing and Querying Ordered XML Using a Relational Database System," Proc. ACM SIGMOD, pp. 204-215, 2002.
[21] X. Wu, M.-L. Lee, and W. Hsu, "A Prime Number Labeling Scheme for Dynamic Ordered XML Trees," Proc. Int'l Conf. Data Eng. (ICDE), pp. 66-78, 2004.
[22] F. Yergeau, "UTF-8, a Transformation Format of ISO 10646," Request for Comments (RFC) 2279, 1998.
[23] M. Yoshikawa and T. Amagasa, "XRel: A Path-Based Approach to Storage and Retrieval of XML Documents Using Relational Databases," ACM Trans. Internet Technology, vol. 1, no. 1, pp. 110-141, 2001.
[24] C. Zhang, J.F. Naughton, D.J. DeWitt, Q. Luo, and G.M. Lohman, "On Supporting Containment Queries in Relational Database Management Systems," Proc. ACM SIGMOD, pp. 425-436, 2001.

Index Terms:
String, dynamic XML update, order-sensitive XML update, reuse of deleted label.
Citation:
Hye-Kyeong Ko, SangKeun Lee, "A Binary String Approach for Updates in Dynamic Ordered XML Data," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 4, pp. 602-607, April 2010, doi:10.1109/TKDE.2009.87
Usage of this product signifies your acceptance of the Terms of Use.