Abstract
Supporting efficient access to XML data using XPath [3] continues to be an important research problem [6, 12]. XPath queries are used to specify nodelabeled trees which match portions of the hierarchical XML data. In XPath query evaluation, indices similar to those used in relational database systems - namely, value indices on tags and text values - are first used, together with structural join algorithms [1, 2, 19]. This approach turns out to be simple and efficient. However, the structural containment relationships native to XML data are not directly captured by value indices.
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
Al-Khalifa, S., et al.: Structural joins: A primitive for efficient XML query pattern matching. In: ICDE (2002)
Bruno, N., et al.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD (2002)
Clark, J., DeRose, S. (eds.): XML path language (XPath) version 1.0. http://www.w3.org/TR/XPATH
Comer, D.: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2), 121–137 (1979)
Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In: VLDB, pp. 436–445 (1997)
Gottlob, G., Koch, C., Pichler, R.: Efficient Algorithms for Processing XPath Queries. ACM Trans. Database Syst. 30(2), 444–491 (2005)
Gyssens, M., et al.: Structural Characterizations of the Semantics of XPath as Navigation Tool on a Document. In: ACM PODS, pp. 318–327. ACM Press, New York (2006)
He, H., Yang, J.: Multiresolution indexing of XML for frequent queries. In: IEEE ICDE, IEEE Computer Society Press, Los Alamitos (2004)
Kaushik, R., et al.: Covering indexes for branching path queries. In: SIGMOD (2002)
Kaushik, R., et al.: Exploiting local similarity for efficient indexing of paths in graph structured data. In: IEEE ICDE, IEEE Computer Society Press, Los Alamitos (2002)
Kaushik, R., et al.: On the integration of structure indexes and inverted lists. In: ACM SIGMOD, ACM Press, New York (2004)
Koch, C.: Processing queries on tree-structured data efficiently. In: ACM PODS, pp. 213–224. ACM Press, New York (2006)
Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)
Moro, M.M., et al.: Tree-pattern queries on a lightweight XML processor. In: VLDB (2005)
Qun, C., Lim, A., Ong, K.W.: D(k)-index: An adaptive structural summary for graph-structured data. In: SIGMOD (2003)
Ramanan, P.: Covering indexes for XML queries: Bisimulation - simulation = negation. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) Databases, Information Systems, and Peer-to-Peer Computing. LNCS, vol. 2944, Springer, Heidelberg (2004)
Runapongsa, K., Patel, J.M., Bordawekar, R., Padmanabhan, S.: XIST: An XML index selection tool. In: Bellahsène, Z., Milo, T., Rys, M., Suciu, D., Unland, R. (eds.) XSym 2004. LNCS, vol. 3186, pp. 219–234. Springer, Heidelberg (2004)
Yi, K., He, H., Stanoi, I., Yang, J.: Incremental maintenence of XML structural indexes. In: ACM SIGMOD, pp. 491–502. ACM Press, New York (2004)
Zhang, C., et al.: On supporting containment queries in relational database management systems. In: SIGMOD (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fletcher, G.H.L., Van Gucht, D., Wu, Y., Gyssens, M., Brenes, S., Paredaens, J. (2007). A Methodology for Coupling Fragments of XPath with Structural Indexes for XML Documents . In: Arenas, M., Schwartzbach, M.I. (eds) Database Programming Languages. DBPL 2007. Lecture Notes in Computer Science, vol 4797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75987-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-75987-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75986-7
Online ISBN: 978-3-540-75987-4
eBook Packages: Computer ScienceComputer Science (R0)