Abstract
When the ID/IDREF relationship is considered, an XML document needs to be modeled as an ordered graph more naturally than an ordered tree. Then it becomes more difficult to process the updates of XML document. This paper studies the incremental maintenance of the document order and reachability relationship in Graph-structured XML. We propose an extended interval labeling scheme to label the document order and reachability relationship in XML. We identify the main reason for the inefficiency of updates of the labels. To accelerate the processing of updates, we design a novel index, called XUI. Based on the index, we propose an efficient update method, called UOGX. Our experimental evaluation illustrates the space efficiency and update performance of the proposed labeling.
This research was partially supported by The National Science and Technology Major Project of Key Electronic Devices, High-end General-purpose Chips and Fundamental Software Products Foundation of China under Grant No. 2010ZX01042-002-003; the Natural Science foundation of China under Grant No 61070055, 91024032, 91124001, 60833005; the Fundamental Research Funds for the Central Universities, and the Research Funds of Renmin University under Grant No. 11XNL010, 10XNI018.
This is a preview of subscription content, log in via an institution to check access.
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
XQuery, http://www.w3.org/TR/xquery/
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: SIGMOD Conference 1989, pp. 253–262. ACM Press, New York (1989)
Wang, H., Li, J., Luo, J., Gao, H.: Hash-basesubgraph query processing method for graph-structured XML documents. PVLDB 1(1), 478–489 (2008)
Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst. 15(4), 558–598 (1990)
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proceedings of the 13th Annual ACMSIAM Symposium on Discrete algorithms, pp. 937–946. ACM Press, New York (2002)
Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-HOP: a high-compression indexing scheme for reachability query. In: SIGMOD Conference 2009, pp. 813–826. ACM Press, New York (2009)
van Schaik, S.J., de Moor, O.: A memory efficient reachability data structure through bit vector compression. In: SIGMOD Conference 2011, pp. 913–924. ACM Press, New York (2011)
Li, C., Ling, T.W., Hu, M.: Efficient updates in dynamic XML data: from binary string to quaternary string. VLDB J 17(3), 573–601 (2008)
Amagasa, T., Yoshikawa, M., Uemura, S.: QRS: A Robust Numbering Scheme for XML Documents. In: The 19th Int. Conf. on Data Engineering (ICDE 2003), pp. 705–707. IEEE Press, New York (2003)
Schmidt, A., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: XMark: A benchmark forXML data management. In: VLDB (2002)
Zhang, C., et al.: On Supporting Containment Queries in Relational Database Management Systems. In: Proc. of ACM SIGMOD, pp. 425–436 (2001)
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
Fu, L., Meng, X. (2012). Efficient Processing of Updates in Dynamic Graph-Structured XML Data. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds) Web-Age Information Management. WAIM 2012. Lecture Notes in Computer Science, vol 7418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32281-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-32281-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32280-8
Online ISBN: 978-3-642-32281-5
eBook Packages: Computer ScienceComputer Science (R0)