Abstract
In this paper, the focus is on accelerating XPath location steps for evaluating regular path expression with predicate parameter in particular since it is a core component of many XML processing standards such as XSLT or XQuery. We present a new indexing structure, namely Xp-tree, which is used to speed-up the evaluation of XPath. Based on accelerating a node using planar combined with the numbering scheme, we devise efficiently derivative algorithms. Our experimental results demonstrate that the proposed method outperforms previous approaches using R-tree indexing mechanism in processing XML queries.
Keywords
- Leaf Node
- Child Node
- XPath Query
- Context Node
- Sibling Node
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was supported by University IT Research Center Project in Korea.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Clark, J., Steven, D.: XML Path Language (XPath). Technical Report W3C Recommendation, Version 1.0 (1999), http://www.w3.org/TR/xpath
Quanzhong, L., Bongki, M.: Indexing and Querying XML Data for Regular Path Expression. In: Proc. of the 27th VLDB Conference, Roma, Italy (2001)
Kha, D.D., Yoshikawa, M.: Uemura. S.: An XML Indexing Structure with Relative Region Coordinate. In: ICDE (2001)
Milo, T., Sucio, D.: Index Structure for Path Expressions. In: Proc. of the Int’l Conf. on Database Theory, pp. 277–295 (1999)
Zhang, C., Naughton, J., DeWitt, D., et al.: on Supporting Containment Queries in Relational Databases Management Systems. In: Proceedings of the 2001 ACM-SIGMOD Conference Santa Barbara, CA (May 2001)
Cooper, B., et al.: A Fast Index for Semistructured Data. In: Proc. of VLDB Conference (2001)
Grust, T.: Accelerating Xpath Location Steps. In: SIGMOD Conference (2002)
Kaushik, R., Naughton, J.F., Bohannon, P., Gudes, E.: Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data. In: ICDE (2002)
Goldman, J., Widom, J.: DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In: Proc. of 23rd VLDB Conference (1997)
Kaushik, R., Naughton, J.F., Bohannon, P., Korth, H.F.: Covering Indexes for Branching Path Queries. In: ACM SIGMOD (2002)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of SIGMOD, Boston, Massachusetts (1984)
Bosak, J.: Religious Texts in XML (1998), http://www.ibiblio.org/xml/examples/religion
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, J.H., Nguyen, V.T., Ryu, K.H. (2005). A New Indexing Structure to Speed Up Processing XPath Queries. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_82
Download citation
DOI: https://doi.org/10.1007/11408079_82
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)