| 移动对象的动态反向k最近邻研究 |
| |
| 引用本文： | 董军,杨秀娟.移动对象的动态反向k最近邻研究[J].计算机工程与应用,2009,45(6):155-157. |
| |
| 作者姓名： | 董军 杨秀娟 |
| |
| 作者单位： | 黑龙江科技学院 计算机与信息工程学院，哈尔滨 150027 |
| |
| 摘 要： | 反向最近邻查询是空间数据库中最重要的算法之一。传统的反向最近邻查询方法主要是针对静态对象的查询，随着无线通讯和定位技术的快速发展，移动对象发出的查询请求成为新的研究热点。该文将TPR-tree作为算法的索引结构，并提出了基于矩形框的对角线的修剪策略，将半平面修剪策略进行改进，给出了移动对象的动态反向k最近邻的查询方案。
|
| 关 键 词： | 空间数据库 最近邻查询 反向最近邻查询 TPR-树 |
| 收稿时间： | 2008-1-14 |
| 修稿时间： | 2008-4-21
|
Research of dynamic reverse k nearest neighbor search for moving objects |
| |
| DONG Jun,YANG Xiu-juan.Research of dynamic reverse k nearest neighbor search for moving objects[J].Computer Engineering and Applications,2009,45(6):155-157. |
| |
| Authors: | DONG Jun YANG Xiu-juan |
| |
| Affiliation: | Department of Computer & Information Engineering，Heilongjiang Institute of Science and Technology，Harbin 150027，China |
| |
| Abstract: | One of the most important algorithms in spatial database is reverse nearest neighbor query.Conventional query method focus on searching static objects mainly.With the rapid advancement in wireless communications and positioning techniques,algorithms for efficiently answering queries about large populations of moving objects are gaining interest.This paper proposes a dynamic reverse nearest neighbor query algorithm for moving objects.TPR-tree is used to indexing continuously moving objects.A trimming strateg... |
| |
| Keywords: | spatial databases nearest neighbor queries reverse nearest neighbor queries TPR-tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
