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.
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
Guttman, A.: R-tree: A Dynamic Index Structure for Spatial Search. In: Proceedings of the ACM SIGMOD Conference on Management of Data, Boston, Massachusetts, pp. 47–57 (1984)
Theodoridis, Y., Sellis, T.: On the Performance Analysis of Multi-Dimensional R-tree-based Data Structures. Knowledge and Database Systems Laboratory, National Technical University of Athens, Greece (1995)
Rsv October. Spatial Access Methods: RSV (2001), citeseer.nj.nec.com/rigaux99spatial.html
Pagel, B.: Towards a analysis of range query performance in spatial data structure (2001), http://www.citeseer.nj.nec.com
Proietti, G., Faloutsos, C.: Accurate Modeling of Region Data. Department of Computer Science, Carnegie Mellon University, Pittsburgh, USA (1998)
Theodoridis, Y., Sellis, T.: A Model for The Prediction of r-tree Performance. In: Proceedings of the15th ACM PODS symposium, Montreal, Canada (1996)
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
Chen, H., Wang, Z. (2005). CR*-Tree: An Improved R-Tree Using Cost Model. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_112
Download citation
DOI: https://doi.org/10.1007/11596448_112
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)