Abstract
We introduce a novel XML labeling scheme called OrdPathX which supports both leaf and internal node insertions for XML data. Dynamic XML labeling has been studied for years. However almost all labeling schemes allow only leaf node insertions. Inspired by the careting-in technique of OrdPath [7], we propose a new labeling algorithm which supports internal node insertions gracefully without relabeling. We will describe the labeling algorithm and the associated operations for various inter-node relationship determination. Experimental results show that OrdPathX can handle internal node insertions efficiently.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
http://www.microsoft.com/sqlserver/2008/en/us/whats-new.aspx
http://download.microsoft.com/download/3/4/C/34C25092-D2A1-4E56-83CF-923EF53BD390/SQLServer2008.pdf
Amagasa, T., Yoshikawa, M., Uemura, S.: A robust numbering scheme for XML documents. In: 19th International Conference on Data Engineering, pp. 705–707 (2003)
Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. In: Proceedings of the 21st Annual ACM Symposium on Principles of Database Systems, pp. 271–281 (2002)
Li, C., Ling, T.W., Hu, M.: Efficient updates in dynamic XML data: from binary string to quaternary string. The VLDB Journal 17, 573–601 (2008)
Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: Proceedings of the 27th International Conference on Very Large Data Bases, pp. 361–370 (2001)
O’Neil, P.E., O’Neil, E.J., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: Insert-friendly XML node labels. In: Proceedings of the 2004 ACM SIGMOD Conference on the Management of Data, pp. 903–908 (2004)
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: Proceedings of SIGMOD, pp. 204–215 (2002)
Sans, V., Laurent, D.: Prefix based numbering schemes for XML: techniques, applications and performances. In: Proceedings of the 35th International Conference on Very Large Data Bases, August 2008, pp. 23–28 (2008)
Santoro, N., Khatib, R.: Labeling and implicit routing in networks. The Computer Journal 28, 5–8 (1985)
Wu, X., Lee, M.L., Hsu, W.: A prime number labeling scheme for dynamic ordered XML trees. In: 20th International Conference on Data Engineering, pp. 66–78 (2004)
Yoshikawa, M., Amagasa, T., Shimura, T., Uemura, S.: XRel: a path-based approach to storage and retrieval of XML documents using relational databases. ACM Transactions on Internet Technology 1(1), 110–141 (2001)
Deschler, K., Rundensteiner, E.: MASS: A Multi-axis Storage structure for Large XML Documents. In: Proc. Conf. on Information and Knowledge Management, pp. 520–523 (2003)
Dang-Ngoc., T.T., Sans, V., Laurent, D.: Classifying XML Materialized views for their maintenance on distributed Web sources. In: Proc EGC Conf., RNTI, pp. 433–444 (2005)
Khaing, A., Thein, N.L.: A Persistent Labeling Scheme for Dynamic Ordered XML Trees. In: Proc. Conf. on Web Intelligence, pp. 498–501 (2006)
Gabillon, A., Fansi, M.: A persistent labelling scheme for XML and tree databases. In: Proc. SITIS Conf., pp. 110–115 (2005)
Duong, M., Zhang, Y.: LSDX: A New Labeling Schema for Dynamically Updating XML Data. In: Proc. ADC Conf., pp. 185–193 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, J., Poon, C.K. (2009). OrdPathX: Supporting Two Dimensions of Node Insertion in XML Data. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2009. Lecture Notes in Computer Science, vol 5690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03573-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-03573-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03572-2
Online ISBN: 978-3-642-03573-9
eBook Packages: Computer ScienceComputer Science (R0)