计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (4): 173-175.
• 数据库与信息处理 • 上一篇 下一篇
张奋 潘梅生 邹北骥
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
Received:
Revised:
Online:
Published:
摘要: 最近邻查询是空间数据库的重要应用之一,最近邻查询概念的扩展,即对象的相似性查询中,利用以往的定位查询以及范围查询方法不能很好的解决最近邻查询的问题,本文在分析NN 查询的基本概念和存储区域的基础上,提出区别于以往NN 查询的基于SR-树的多对象NN 查询方法,根据某几个查询点,找出离它们最近的一个点或者是k 个点,在某种意义上是寻求一种最优方案。
关键词: 空间对象, 最小距离, 最小最大距离, SR-树, 最近邻
Abstract: The nearest neighbor query is one of the most important application of spatial database, its conception extension, namely in the similarity queries of objects, to use 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, proposing based on SR-tree multi-objects NN query method different from former methods, in case of some query spots, to find out the nearest one or k spots, to seek a best method in some kind.
Key words: Spatial object, MINDIST, MINMAXDIST, SR-tree, Nearest neighbor
张奋 潘梅生 邹北骥. 基于SR-树的空间对象最近邻查询[J]. 计算机工程与应用, 2007, 43(4): 173-175.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I4/173