约束的移动对象最近邻轨迹查询  

Nearest neighbor search for constrained moving objects trajectories

作　　者：卢炎生[1] 许浒[1] 潘鹏[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2007年第2期57-60,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：湖北省自然科学基金资助项目(ABA048)

摘　　要：提出了一种新的查询概念,即约束的移动对象最近邻轨迹(constrained nearest neighbor search on mov-ing objects trajectories,简称CNNMOT)查询.针对两阶段算法分阶段处理最近邻查询和范围查询的缺陷,对传统空间最近邻算法进行了改进和扩展,使其能够合并到一步完成,并对传统的mindist定义进行了修改.实验结果表明:该改进算法能较好地克服两阶段算法的缺陷,并在数据量较大时仍保持较高的性能.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.

关 键 词：移动对象 最近邻查询 范围查询 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]