对基于R-Tree的空间连接代价模型进行了探讨,主要研究了HUANG Y W提出的空间连接代价模型。利用最优/最差选择策略降低该算法的时间复杂度,对基于缓冲区的代价模型提出了改进后的评估公式,通过实验验证了改进后的模型比原模型提高了评...对基于R-Tree的空间连接代价模型进行了探讨,主要研究了HUANG Y W提出的空间连接代价模型。利用最优/最差选择策略降低该算法的时间复杂度,对基于缓冲区的代价模型提出了改进后的评估公式,通过实验验证了改进后的模型比原模型提高了评估的精确度。展开更多
The characteristic of geographic information system（GfS） spatial data operation is that query is much more frequent than insertion and deletion, and a new hybrid spatial clustering method used to build R-tree for GI...The characteristic of geographic information system（GfS） spatial data operation is that query is much more frequent than insertion and deletion, and a new hybrid spatial clustering method used to build R-tree for GIS spatial data was proposed in this paper. According to the aggregation of clustering method, R-tree was used to construct rules and specialty of spatial data. HCR-tree was the R-tree built with HCR algorithm. To test the efficiency of HCR algorithm, it was applied not only to the data organization of static R-tree but also to the nodes splitting of dynamic R-tree. The results show that R-tree with HCR has some advantages such as higher searching efficiency, less disk accesses and so on.展开更多
大量GIS应用的地图显示功能具有多尺度特性 .Hilbert R Tree索引与此特性不相适应 .使用它访问绘图数据存在I/O粒度偏小和同等级簇聚程度低两个问题 ,导致访问效率不高 .该文对它作出改进 ,提出一种新型索引即多级Hilbert R Tree索引 (H...大量GIS应用的地图显示功能具有多尺度特性 .Hilbert R Tree索引与此特性不相适应 .使用它访问绘图数据存在I/O粒度偏小和同等级簇聚程度低两个问题 ,导致访问效率不高 .该文对它作出改进 ,提出一种新型索引即多级Hilbert R Tree索引 (HierarchicalHilbert R Tree ,HHRT) .HHRT解决了上述两个问题 .实验证明后者的访问效率比前者有较大的提高 .展开更多
文摘The characteristic of geographic information system（GfS） spatial data operation is that query is much more frequent than insertion and deletion, and a new hybrid spatial clustering method used to build R-tree for GIS spatial data was proposed in this paper. According to the aggregation of clustering method, R-tree was used to construct rules and specialty of spatial data. HCR-tree was the R-tree built with HCR algorithm. To test the efficiency of HCR algorithm, it was applied not only to the data organization of static R-tree but also to the nodes splitting of dynamic R-tree. The results show that R-tree with HCR has some advantages such as higher searching efficiency, less disk accesses and so on.
文摘大量GIS应用的地图显示功能具有多尺度特性 .Hilbert R Tree索引与此特性不相适应 .使用它访问绘图数据存在I/O粒度偏小和同等级簇聚程度低两个问题 ,导致访问效率不高 .该文对它作出改进 ,提出一种新型索引即多级Hilbert R Tree索引 (HierarchicalHilbert R Tree ,HHRT) .HHRT解决了上述两个问题 .实验证明后者的访问效率比前者有较大的提高 .
