R-tree空间索引方法的优化研究

Research Base on the Improved R-tree Spatial Index

针对R-tree优化所面临的问题,提出了一种改进的R树索引算法。该算法利用Hilbert曲线的聚类特性解决了R树查询路径的非唯一性问题;通过最小外接矩形分解技术(DMBR)确定多边形的形状,直接获得空间对象的具体结构信息,获得了更高效的查询效率。

In this paper,an improved R-tree index is proposed to solve the problems that the existing R-tree algorithms encounter.The new index uses the Hilbert curve to solve the problem of nonexclusive query path,and uses the decomposition minimum boundary rectangle technique to get the precise shape of the spatial objects and the more efficient query results.