摘要
针对基于R-树的空间索引结构存在的节点覆盖冗余,兄弟节点之间的交叠问题,提出一种新的空间索引结构即RP-树。通过最适合划分函数和数据矩形的有序关系来对空间数据进行划分,使得该树的高度尽可能低,节点交叠较小。以RP-树为平面线段集的索引结构,利用线段集的相关定理和筛选规则,给出了一个求解平线段集最近邻的新查询算法,该算法不仅易于理解,且执行效率较高。
Aiming at the problem of the node covering redundancy and the overlap between brother nodes in R-tree spatial index structure,a new index structure which is called RP-tree is proposed.Spatial data is partitioned through the most suit- able function and the ordered data rectangular,therefore the height of the tree becomes as low as possible and nodes overlap smaller.To RP-tree index structure, using screening rules and the relevant line segment set theorem,a new algorithm of nearest neighbor query of line segment set is given,which is easy to understand,and is implemented efficiently.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第29期143-145,共3页
Computer Engineering and Applications
基金
黑龙江省自然科学基金(No.F200601)
黑龙江省教育厅2011年度科学技术研究项目资助(No.12511103)
哈尔滨理工大学教改项目(No.P201000054)
关键词
线段集
RP-树
空间索引
最近邻
line segment set
RP-tree
spatial index
nearest neighbor
