R-树结点分配的新算法  

New algorithm of distributing nodes in R-tree

作　　者：安晓华[1] 刘润涛[2] 王三[1] 

机构地区：[1]哈尔滨理工大学应用科学学院,哈尔滨150080 [2]哈尔滨理工大学信息与科学计算技术研究所,哈尔滨150080

出　　处：《计算机工程与应用》2009年第3期158-160,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(No.10571037);黑龙江省教育厅资助项目(No.11511027)~~

摘　　要：近年来,针对空间数据库索引的研究引起了人们越来越多的兴趣和关注。为了快速、有效地处理存储于空间数据库中的海量空间数据,专家学者提出了大量的基于磁盘的空间索引方法。其中,1984年Guttman提出的R-树是目前非常有效的空间索引结构。针对R-树的结点分配算法存在的不足,提出了一种新的结点分配算法。研究结果表明:新的分配算法比原始的算法产生的交叠会更小,从而有效地控制了多路查询的几率,较明显地提高了空间查询的效率。In recent years,the research on spatial indexing is arousing more and more interests and attentions.A great number of spatial indexing structures based on secondary memory have been proposed for handling the massive spatial data stored in the spatial database rapidly and efficiently.R-tree,proposed by Guttman in 1984,is the most efficient spatial index structure now.In this paper,a new algorithm is presented for overcoming the diavantages of the old algorithm in distributing node of R-tree.The result of study indicates the new algorithm brings smaller overlap,thereby the probability of multi-way query is efficiently controlled,and the efficiency of spatial query is improved effectively.

关 键 词：空间索引 空间查询 R-树 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]