首页 | 本学科首页   官方微博 | 高级检索  
     

R-tree的查询代价模型分析及算法改进
引用本文:陈海波,王申康.R-tree的查询代价模型分析及算法改进[J].计算机辅助设计与图形学学报,2003,15(3):277-282.
作者姓名:陈海波  王申康
作者单位:浙江大学计算机科学与技术系,杭州,310027
摘    要:提出一个R-tree的查询代价模型(Cost Model) ,在对该模型分析的基础上,对R-tree及其变种进行了改进,形成了CR^*-tree,分别对Cost Model和CR^*-tree做了实验,结果显示该Cost Model的平均误差为12.6%,而改进后的CR^*-tree查询性能比R^*-tree提高了4.25%。

关 键 词:Cost  Model  CR^*-tree  空间数据结构
修稿时间:2001年12月4日

Cost Model of R-tree and Algorithmic Optimization
Chen Haibo,Wang Shenkang.Cost Model of R-tree and Algorithmic Optimization[J].Journal of Computer-Aided Design & Computer Graphics,2003,15(3):277-282.
Authors:Chen Haibo  Wang Shenkang
Abstract:We present a cost model for predicting the performance of R-tree and its variants. Optimization based on the cost model can be applied to R-tree construction. We construct a new R-tree variant named CR *-tree using this cost model. Experiment results show that the relative error of the cost model is around 12.6%, and the performance for querying CR *-tree has been improved 4.25% in contrast with R *-tree's.
Keywords:cost model  CR  *-tree  spatial data structure  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号