TY - GEN
T1 - A new structure for accelerating Xpath location steps
AU - Feng, Yaokai
AU - Makinouchi, Akifumi
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33746047501&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746047501&partnerID=8YFLogxK
U2 - 10.1007/11775300_5
DO - 10.1007/11775300_5
M3 - Conference contribution
AN - SCOPUS:33746047501
SN - 3540352252
SN - 9783540352259
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 49
EP - 60
BT - Advances in Web-Age Information Management - 7th International Conference, WAIM 2006, Proceedings
PB - Springer Verlag
T2 - 7th International Conference on Advances in Web-Age Information Management, WAIM 2006
Y2 - 17 June 2006 through 19 June 2006
ER -