Abstract
XML databases provide index structures to accelerate queries on the content and structure of XML documents. As index structures must be consistent with the documents on which they are defined, updates on documents need to be propagated to affected index structures. This paper presents an index maintenance algorithm that is solely based on index definitions and update fragments instead of on the maintenance of auxiliary data structures. The use of index definitions assures that the algorithm supports arbitrary index structures defined on arbitrary document fragments. By exploiting the structure of update fragments, the algorithm directly extracts the nodes which are required for index maintenance from the fragments. Source queries are only necessary if the fragment does not contain all nodes required for indexing. The presented performance studies demonstrate the advantages of this approach over previous work that propagates each updated node individually.
This work was supported by FIT-IT under grant 809262/9315-KA/HN.
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
Catania, B., Maddalena, A., Vakali, A.: XML Document Indexes: A Classification. IEEE Internet Computing 9(5), 64–71 (2005)
Bertino, E., Foscoli, P.: Index Organizations for Object-Oriented Database Systems. IEEE Transactions on Knowledge and Data Engineering 7(2), 193–209 (1995)
Chaudhri, A., Zicari, R., Rashid, A.: Xml Data Management: Native XML and XML-Enabled Database Systems. Addison-Wesley Longman Publishing, Reading (2003)
Hammerschmidt, B.C.: KeyX: Selective Key-Oriented Indexing in Native XML-Databases. PhD thesis
Liefke, H., Davidson, S.B.: View Maintenance for Hierarchical Semistructured Data. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds.) DaWaK 2000. LNCS, vol. 1874, pp. 114–125. Springer, Heidelberg (2000)
El-Sayed, M., Wang, L., Ding, L., Rundensteiner, E.: An Algebraic Approach for Incremental Maintenance of Materialized XQuery Views. In: WIDM, pp. 88–91. ACM Press, New York (2002)
Yao, J., Zhang, M.: A Fast Tree Pattern Matching Algorithm for XML Query. In: Web Intelligence, pp. 235–241. IEEE Computer Society Press, Los Alamitos (2004)
Bille, P., Li Gørtz, I.: The Tree Inclusion Problem: In Optimal Space and Faster. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 66–77. Springer, Heidelberg (2005)
Diao, Y., Altinel, M., Franklin, M.J., Zhang, H., Fischer, P.M.: Path Sharing and Predicate Evaluation for High-Performance XML Filtering. ACM Transactions on Database Systems (TODS) 28(4), 467–516 (2003)
Grün, K., Karlinger, M., Schrefl, M.: Schema-aware Labelling of XML Documents for Efficient Query and Update Processing in SemCrypt. Computer Systems Science and Engineering 21(1), 65–82 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Grün, K., Schrefl, M. (2007). Exploiting the Structure of Update Fragments for Efficient XML Index Maintenance. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)