CIS 2005: Computational Intelligence and Security pp 758-764 | Cite as
CR*-Tree: An Improved R-Tree Using Cost Model
Conference paper
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.
Keywords
Spatial Data Child Node Cost Model Range Query Spatial Object
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.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)Google Scholar
- 2.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)Google Scholar
- 3.Rsv October. Spatial Access Methods: RSV (2001), citeseer.nj.nec.com/rigaux99spatial.html
- 4.Pagel, B.: Towards a analysis of range query performance in spatial data structure (2001), http://www.citeseer.nj.nec.com
- 5.Proietti, G., Faloutsos, C.: Accurate Modeling of Region Data. Department of Computer Science, Carnegie Mellon University, Pittsburgh, USA (1998)Google Scholar
- 6.Theodoridis, Y., Sellis, T.: A Model for The Prediction of r-tree Performance. In: Proceedings of the15th ACM PODS symposium, Montreal, Canada (1996)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2005