作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (10): 40-42. doi: 10.3969/j.issn.1000-3428.2008.10.015

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

移动对象的动态反向最近邻查询技术

李 松1,郝忠孝1,2,3   

  1. (1. 哈尔滨理工大学计算机科学与技术学院,哈尔滨 150080;2. 齐齐哈尔大学计算机与控制工程学院,齐齐哈尔 161006;3. 哈尔滨工业大学计算机科学与技术学院,哈尔滨 150001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-05-20 发布日期:2008-05-20

Query Technology of Dynamic Reverse Nearest Neighbors for Moving Object

LI Song1, HAO Zhong-xiao1,2,3   

  1. (1. School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080; 2. School of Computer and Control Engineering, Qiqihar University, Qiqihar 161006; 3. School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-05-20 Published:2008-05-20

摘要: 为了处理移动对象的动态反向最近邻,对时空动态反向最近邻查询问题进行形式化的定义,利用时空距离函数及限界区域等概念给出计算移动对象的动态反向最近邻的定理与算法,提出移动查询点的动态最近邻的全域查询及局域查询的方法,利用动态检测圆及时空距离函数进行动态反向最近邻的查询判断,其计算量可减少40%~60%。构建新的时空索引结构——TPRDNN树,给出操作TPRDNN树的查询算法。

关键词: 动态反向最近邻, 六分区域, 距离函数, TPRDNN树

Abstract: To solve the dynamic reverse nearest neighbor queries for the moving objects, the definition and the primary properties of the reverse nearest neighbors are proposed and the theorems and arithmetics for computing the dynamic reverse nearest neighbors using the conceptions of the distance-function and delimitation-regions are developed. To get the dynamic reverse nearest neighbors, the methods based on the distance-function and the dynamic inspect-circle are proposed. The amount of the calculation can be reduced by 40%~60%. To solve this question in the spatio-temporal database, a new spatio-temporal index tree——TPRDNN tree is presented and the arithmetics for querying the new tree are introduced.

Key words: dynamic reverse nearest neighbors, six-dividing regions, distance-function, TPRDNN tree

中图分类号: