检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (06): 91-93.doi: 10.3969/j.issn.1000-3428.2010.06.030

• 软件技术与数据库 • 上一篇    下一篇

球面上最近邻空间关系处理方法

李 松1，郝忠孝1,2   

  1. (1. 哈尔滨理工大学计算机科学与技术学院，哈尔滨 150080；2. 哈尔滨工业大学计算机科学与技术学院，哈尔滨 150001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-20 发布日期:2010-03-20

Methods for Handling Nearest Neighbor Spatial Relations on Spherical Surface

LI Song1, HAO Zhong-xiao1,2   

  1. (1. School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080;2. School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-20 Published:2010-03-20

PDF

979

被引次数

8 | 5

摘要： 根据球面上数据对象点的特征和空间数据库查询的需要，给出2种处理球面上最近邻查询的方法，即利用欧氏空间内的空间数据索引结构方法和球面投影于平面方法。在动态密集数据集和动态稀松数据集2种典型情况下分别对该2种方法处理最近邻查询的能力进行分析，结果表明，该2种方法能有效处理球面上具有不同性质特征的空间数据对象点的近邻查询问题。

关键词: 最近邻, R树, TPR*树, TCS树

Abstract: According to the characteristics of the data objects on spherical surface and the needs of spatial database query, this paper proposes two methods for handling Nearest Neighbor(NN) query on spherical surface, which are the query method base on the spatial index structure in Euclidean space named SPINS and the method of spherical surface projecting the plane named CTPS. The performances of the two methods are analyzed with dynamic dense dataset and dynamic sparse dataset. The result shows that the two methods can handle NN query of the data objects with the different properties on spherical surface efficiently.

Key words: Nearest Neighbor(NN), R tree, TPR* tree, TCS tree

中图分类号: