TY - GEN
T1 - Improving query performance on OLAP-data using enhanced multidimensional indices
AU - Feng, Yaokai
AU - Makinouchi, Akifumi
AU - Ryu, Hiroshi
PY - 2004/11/24
Y1 - 2004/11/24
N2 - Multidimensional indices are efficient to improve the query performance on OLAP data. As one multi-dimensional index structure, R*-tree is popular and successful, which is a member of the famous R-tree family. We enhance the R*-tree to improve the performance of range queries on OLAP data. First, the following observations are presented. (1) The clustering pattern of the tuples (of the OLAP data) among the R*-tree leaf nodes is a decisive factor on range search performance and it is controllable. (2) There often exist many slender nodes when the R*-tree is used to index OLAP data, which causes some problems both with the R*-tree construction and with queries. And then, we propose an approach to control the clustering pattern of tuples and propose an approach to solve the problems of slender nodes, where slender nodes refer to those having a very narrow side (even the side length is zero) in some dimension. Our proposals are examined by experiments using synthetic data and TPC-H benchmark data.
AB - Multidimensional indices are efficient to improve the query performance on OLAP data. As one multi-dimensional index structure, R*-tree is popular and successful, which is a member of the famous R-tree family. We enhance the R*-tree to improve the performance of range queries on OLAP data. First, the following observations are presented. (1) The clustering pattern of the tuples (of the OLAP data) among the R*-tree leaf nodes is a decisive factor on range search performance and it is controllable. (2) There often exist many slender nodes when the R*-tree is used to index OLAP data, which causes some problems both with the R*-tree construction and with queries. And then, we propose an approach to control the clustering pattern of tuples and propose an approach to solve the problems of slender nodes, where slender nodes refer to those having a very narrow side (even the side length is zero) in some dimension. Our proposals are examined by experiments using synthetic data and TPC-H benchmark data.
UR - http://www.scopus.com/inward/record.url?scp=8544270942&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=8544270942&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:8544270942
SN - 9728865007
T3 - ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems
SP - 282
EP - 289
BT - ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems
A2 - Seruca, I.
A2 - Filipe, J.
A2 - Hammoudi, S.
A2 - Cordeiro, J.
T2 - ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems
Y2 - 14 April 2004 through 17 April 2004
ER -