CR*-Tree: an improved R-tree using cost model

Authors:
Haibo Chen;Zhanquan Wang
Affiliations:
Department of Computer Science, Zhejiang University, Hangzhou, China;Department of computer science and engineering, East China University of Science and Technology, Shanghai, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 2
Cited 0

A model for the prediction of R-tree performance

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a cost model for predicting the performance of R-tree and its variants. Optimization base on the cost model can be apply in R-tree construction. we construct a new R-tree variant called CR*-tree using this optimization technique. Experiments have been carried out ,results show that relative error of the cost model is around 12.6%,and the performance for querying CR*-tree has been improved 4.25% by contrast with R*-tree’s.