| 基于范围查询的移动对象快照KNN查询算法 |
| |
| 引用本文： | 卢秉亮,刘娜,张大伟. 基于范围查询的移动对象快照KNN查询算法[J]. 计算机工程, 2012, 38(7): 49-52,56 |
| |
| 作者姓名： | 卢秉亮 刘娜 张大伟 |
| |
| 作者单位： | 沈阳航空航天大学计算机学院,沈阳,110136 |
| |
| 摘 要： | 提出一种基于范围查询的移动对象快照K最近邻(KNN)查询算法——SKNN。预估包含结果集的子空间，使用该子空间作为范围，计算查询点的KNN兴趣点，以降低I/O成本。引入移动数据库中的缓存技术，缩短查询的平均响应时间。实验结果表明，当移动对象的规模较大时，SKNN算法的性能较优。
|
| 关 键 词： | 移动数据库 范围查询 位置相关 K最近邻 双索引 缓存 |
| 收稿时间： | 2011-05-04 |
Moving Objects Snapshot KNN Query Algorithm Based on Range Query |
| |
| LU Bing-liang , LIU Na , ZHANG Da-wei. Moving Objects Snapshot KNN Query Algorithm Based on Range Query[J]. Computer Engineering, 2012, 38(7): 49-52,56 |
| |
| Authors: | LU Bing-liang LIU Na ZHANG Da-wei |
| |
| Affiliation: | (School of Computer,Shenyang Aerospace University,Shenyang 110136,China) |
| |
| Abstract: | This paper presents a moving objects snapshot K Nearest Neighbor(KNN) query algorithm based on range query,named SKNN.It estimates the subspace containing the result set and uses the subspace as range to efficiently compute the KNN Points of Interest(POIs) from the query points to reduce I/O cost.It introduces cache to shorten the average response time of query.Experimental results show that after introducing cache,SKNN has better performance while scaling to a very large number of moving objects. |
| |
| Keywords: | mobile database range query location-dependent K Nearest Neighbor(KNN) dual index cache |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
