基于SR-树的空间对象反最近邻查询技术研究  

Nearest Neighbor Queries of Spatial Object Based on SR-tree

作　　者：张奋[1] 肖政宏[2] 

机构地区：[1]湖南文理学院计算机系,湖南常德415000 [2]中南大学信息与工程学院,湖南长沙410083

出　　处：《西华大学学报（自然科学版）》2007年第3期44-47,共4页Journal of Xihua University:Natural Science Edition

基　　金：湖南省教育厅科研基金项目(No.05C719)

摘　　要：反最近邻查询是空间数据库的重要应用之一,是在最近邻查询基础上提出的一种新的查询类型,以往基于范围查询或最近邻查询的方法搜索影响集效率不高,本文在分析RNN查询的基本概念和存储区域的基础上,区别于R*-树,提出了基于SR-树的RNN查询方法,优化了空间对象的反最近查询性能,在高维空间查询上具有明显优势。The nearest neighbor query is one of the most important applications in spatial database,its conception extension,namely in the similarity queries of objects,which uses former location query and range query can not well solve the nearest neighbor query.On the foundation of analyzing the basic concepts and storage range of NN queries,this paper proposes an approach,which is different from former ones based on SR-tree multi-objects NN query method.In the method proposed an optimal scheme is achieved by finding out the nearest one or k spots in the case of some query spots.

关 键 词：R＊-树 SR-树 反最近邻 空间对象 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]