| 约束的移动对象最近邻轨迹查询 |
| |
| 引用本文： | 卢炎生,许浒,潘鹏.约束的移动对象最近邻轨迹查询[J].华中科技大学学报(自然科学版),2007,35(2):57-60. |
| |
| 作者姓名： | 卢炎生 许浒 潘鹏 |
| |
| 作者单位： | 华中科技大学,计算机科学与技术学院,湖北,武汉,430074 |
| |
| 摘 要： | 提出了一种新的查询概念,即约束的移动对象最近邻轨迹(constrained nearest neighbor search on moving objects trajectories,简称CNNMOT)查询.针对两阶段算法分阶段处理最近邻查询和范围查询的缺陷,对传统空间最近邻算法进行了改进和扩展,使其能够合并到一步完成,并对传统的mindist定义进行了修改.实验结果表明:该改进算法能较好地克服两阶段算法的缺陷,并在数据量较大时仍保持较高的性能.
|
| 关 键 词： | 移动对象 最近邻查询 范围查询 约束 移动对象 最近邻算法 轨迹查询 trajectories objects moving constrained search 性能 数据量 改进算法 结果 实验 修改 mindist 扩展 传统空间 缺陷 范围查询 |
| 文章编号： | 1671-4512（2007）02-0057-04 |
| 收稿时间： | 2005-10-09 |
| 修稿时间： | 2005年10月9日 |
Nearest neighbor search for constrained moving objects trajectories |
| |
| Lu Yansheng,Xu Hu,Pan Peng.Nearest neighbor search for constrained moving objects trajectories[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2007,35(2):57-60. |
| |
| Authors: | Lu Yansheng Xu Hu Pan Peng |
| |
| Abstract: | A new notion of query,i.e.constrained nearest neighbor search for moving objects trajectories(CNNMOT) was introduced.After the disadvantages of two phase algorithm,which processes nearest neighbor query and range query in step,were considered,the spatial nearest neighbor query algorithm was modified and extended to integrate into one step.The traditional notion of mindist was also revised.Experimental results show that the modified algorithm can overcome the shortcomings of two-tier algorithm and keep its higher performance when the data are numeruous. |
| |
| Keywords: | moving objects nearest neighbor query range query |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
