Abstract
Multidimensional indices have been successfully introduced to the field of querying on XML data. Using R*-tree, T. Grust proposed an interesting method to support all XPath axes. In that method, each node of an XML document is labeled with a five-dimensional descriptor. All the nodes of the XML document are mapped to a point set in a five-dimensional space. T. Grust made it clear that each of the XPath axes can be implemented by a range query in the above five-dimensional space. Thus, R*-tree can be used to improve the query performance for XPath axes. However, according to our investigations, most of the range queries for the XPath axes are partially-dimensional range queries. That is, the number of query dimensions in each of the range queries is less than five, although the R*-tree is built in the five-dimensional space. If the existing multidimensional indices are used for such range queries, then a great deal of information that is irrelevant to the queries also has to be read from disk. Based on this observation, a new multidimensional index structure (called Adaptive R*-tree) is proposed in this paper to support the XPath axes more efficiently.
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
Grust, T.: Accelerating XPath Location Steps. In: Proc. ACM SIGMOD International Conference, pp. 109–120 (2002)
Berglund, A., Boag, S., Chamberlin, D., Fernandez, M.F., et al.: XML Path Language (XPath) 2.0. Technical Report W3C Working Draft, Version 2.0, World Wide Web Consortium (December 2001), http://www.w3.org/TR/xpath20/
Boag, S., Chamberlin, D., Fernandez, M.F., et al.: XQuery 1.0: An XML query language. In: W3C Working Draft, August 16 (2002), http://www.w3.org/TR/xquery
Cooper, B.F., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: A Fast Index for Semistructured Data. In: Proc. the 27th International Conference on Very Large Data Bases (VLDB), pp. 341–360 (2001)
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proc. the 27th International Conference on Very Large Data Bases (VLDB), pp. 361–370 (2001)
Suciu, D., Milo, T.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1999)
Goldman, R., Widom, J.: DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In: Proc. the 23rd International Conference on Very Large Databases (VLDB), pp. 436–445 (1997)
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 425–436 (2001)
Kriegel, H.P., Potke, M., Seidl, T.: Managing Intervals efficiently in Object- Relational Databases. In: Proc. the 26th International Conference on Very Large Databases, VLDB, pp. 407–418 (2000)
Kriegel, H.P., otke, M.P., Seidl, T.: Managing Intervals Efficiently in Object- Relational Databases. In: Proc. the 26th International Conference on Very Large Databases (VLDB), pp. 407–418 (2000)
Dietz, P.F., Sleator, D.D.: Two Algorithms for Maintaining Order in a List. In: Proc. the 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 365–372. ACM Press, New York (1987)
Beckmann, N., Kriegel, H.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM SIGMOD Intl. Conf., pp. 322–331 (1990)
Hjaltason, G.R.l., Samet, H.: Distance Browsing in Spatial Database. ACM Transactions on Database Systems 24(2), 265–318 (1999)
Schmidt, A.R., Waas, F., Kersten, M.L., Florescu, D., Manolescu, I., Carey, M.J., Busse, R.: The XML Benchmark Project. Technical Report INSR0103, CWI, Amsterdam, The Netherlands (April 2001)
Jiang, H., Lu, H., Wang, W., Ooi, B.C.: XR-Tree: Indexing XML Data for Efficient Structural Joins. In: Proc. International Conference on Data Engineering (ICDE), pp. 253–263 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, Y., Makinouchi, A. (2006). A New Structure for Accelerating XPath Location Steps. In: Yu, J.X., Kitsuregawa, M., Leong, H.V. (eds) Advances in Web-Age Information Management. WAIM 2006. Lecture Notes in Computer Science, vol 4016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775300_5
Download citation
DOI: https://doi.org/10.1007/11775300_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35225-9
Online ISBN: 978-3-540-35226-6
eBook Packages: Computer ScienceComputer Science (R0)