对基于R-Tree的空间连接代价模型进行了探讨,主要研究了HUANG Y W提出的空间连接代价模型。利用最优/最差选择策略降低该算法的时间复杂度,对基于缓冲区的代价模型提出了改进后的评估公式,通过实验验证了改进后的模型比原模型提高了评...对基于R-Tree的空间连接代价模型进行了探讨,主要研究了HUANG Y W提出的空间连接代价模型。利用最优/最差选择策略降低该算法的时间复杂度,对基于缓冲区的代价模型提出了改进后的评估公式,通过实验验证了改进后的模型比原模型提高了评估的精确度。展开更多
Multi-level spatial index techniques are always used in large spatial databases. After a general survey of R-tree relevant techniques, this paper presents a novel 2-level index structure, which is based on the schemas...Multi-level spatial index techniques are always used in large spatial databases. After a general survey of R-tree relevant techniques, this paper presents a novel 2-level index structure, which is based on the schemas of spatial grids, Hilbert R-tree and common R-tree. This structure is named H2R-tree, and it is specifically suitable for the indexing highly skewed, distributed, and large spatial database. Algorithms and a sample are given subsequently.展开更多
文摘Multi-level spatial index techniques are always used in large spatial databases. After a general survey of R-tree relevant techniques, this paper presents a novel 2-level index structure, which is based on the schemas of spatial grids, Hilbert R-tree and common R-tree. This structure is named H2R-tree, and it is specifically suitable for the indexing highly skewed, distributed, and large spatial database. Algorithms and a sample are given subsequently.