• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2006, Vol. 28 ›› Issue (6): 92-94.

• 论文 • 上一篇    下一篇

基于空间网络数据库的组最近邻居查询

殷贤亮 陈锡清 卢炎生   

  • 出版日期:2006-06-01 发布日期:2010-05-20

  • Online:2006-06-01 Published:2010-05-20

摘要:

组最近邻居查询是空间数据库在最近邻居查询上的新问题.目前,对组最近邻居查询的研究局限于欧氏空间,考察的只是对象间的相对位置关系,无法处理现实生活中对象间的连通性问题.鉴于此,本文基于空间网络数据库提出以网络距离为度量标准的组最近邻居查询概念,进而提出作为其算法基础的增量最近邻居查询算法INNN,最后构造出算法NMQM.
实验证明,NMQM是一种有效的组最近邻居查询算法.

关键词: 空间网络数据库 最近邻居查询 组最近邻居查询

Abstract:

Group nearest neighbor (GNN) query is a novel form of nearest neighbor search in spatial databases. Most exiting work considers only the Euclidean s pace, where the distance between two objects is determined solely by their relative positions but not their connectivity. So, this paper proposes the co  nception of GNN query using network distance in the context of spatial network databases, and proposes the algorithm INNN, which is the bassis of GNN queries, and the algorithm NMQM. The experimental results prove that NMQM is an effective algorithm.

Key words: (spatial network database, nearest neighbor query, group nearest neighbor query)