Abstract
In order to accelerate execution of various matching and navigation operations on collections of XML documents, new indexing structure, based on tree signatures, is proposed. We show that XML tree structures can be efficiently represented as ordered sequences of preorder and postorder ranks, on which extended string matching techniques can easily solve the tree matching problem. We also show how to apply tree signatures in query processing and demonstrate that a speedup of up to one order of magnitude can be achieved over the containment join strategy. Other alternatives of using the tree signatures in intelligent XML searching are outlined in the conclusions.
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.
Similar content being viewed by others
References
Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: Optimal XML pattern matching. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison Wisconsin, USA, June 2002, pp. 310–321. ACM, New York (2002)
Chien, S., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient structural joins on indexed XML documents. In: Proceedings of the 28rd VLDB Conference, Honk Kong, China, pp. 263–274 (2002)
World Wide Web Consortium. XML path language (XPath), version 1.0, W3C. Recommendation (November 1999)
World Wide Web Consortium. XQuery 1.0: An XML query language. W3C Working Draft (November 2002), http://www.w3.org/TR/xquery
Grust, T.: Accelerating XPath location steps. In: Proceedings of the 2002 ACM SIGMOD international conference on Management of data, Madison, Wisconsin, pp. 109–120. ACM Press, New York (2002)
Gusfield, D.: Algorithms on Strings, trees, and Sequences. Cambridge University Press, Cambridge (1997)
Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Comm. ACM 20(5), 350–353 (1977)
Theobald, A., Weikum, G.: The index-based XXL search engine for querying XML data with relevance ranking. In: Jensen, C.S., Jeffery, K.G., Pokorný, J., Saltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 477–495. Springer, Heidelberg (2002)
Tiberio, P., Zezula, P.: Storage and retrieval: Signature file access. In: Kent, A., Williams, J.G. (eds.) Encyclopedia of Microcomputers, vol. 16, pp. 377–403. Marcel Dekker Inc., New York (1995)
Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On supporting containment queries in relational database management systems. In: Walid, G. (ed.) ACM SIGMOD Conference 2001, Proceedings, Santa Barbara, CA, USA. ACM, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zezula, P., Amato, G., Debole, F., Rabitti, F. (2003). Tree Signatures for XML Querying and Navigation. In: Bellahsène, Z., Chaudhri, A.B., Rahm, E., Rys, M., Unland, R. (eds) Database and XML Technologies. XSym 2003. Lecture Notes in Computer Science, vol 2824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39429-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-39429-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20055-0
Online ISBN: 978-3-540-39429-7
eBook Packages: Springer Book Archive