基于旅行时间的Top-k轨迹查询  

Top-k Trajectory Query Based on Traveling Time

作　　者：陈子军[1,2] 杨蕊 刘文远 刘永山[1,2] CHEN Zi-jun;YANG Rui;LIU Wen-yuan;LIU Yong-shan(School of Information Science and Engineering,Yanshan University,Qinhuangdao 066004,China)(The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province,Qinhuangdao 066004,China)

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004 [2]河北省计算机虚拟技术与系统集成重点实验室,河北秦皇岛066004

出　　处：《小型微型计算机系统》2019年第7期1496-1502,共7页Journal of Chinese Computer Systems

基　　金：河北省重点研发计划项目(18270307D)资助;河北省自然科学基金项目(F2017203019)资助

摘　　要：为了进一步完善现有的轨迹查询,本文提出一种基于旅行时间的Top-k轨迹查询,给定查询点,可以为用户返回k条轨迹.这k条轨迹的选择依赖于用户感兴趣的位置点和旅行时间,为用户返回k条旅行时间最短的轨迹.针对该查询,提出一种查询算法,利用网格索引来记录轨迹点的信息,算法使用Best-First方法对查询点附近的轨迹点进行检索,并通过判断其是否为有效点来检索完全有效轨迹.为了提高查询效率,提出三种终止规则,其减少了需要访问轨迹点的数量.最后,通过实验验证该算法的有效性.In order to further improve the existing trajectory query,w e propose a top-k trajectory query based on traveling time,w hich returns k trajectories according to the given query points.The selected k trajectories depend on the user’s interested locations and the traveling time used along the trajectory and k trajectories w ith shortest traveling time are returned.With grid index,the information of trajectory points is recorded.The Best-First is used to search trajectory points close to query points and the query identifies the effective points to retrieve complete effective trajectories.In order to improve the efficiency of the algorithm,three kinds of termination rules are proposed.Finally,extensive experiments demonstrate the efficiency of our presented algorithms.

关 键 词：轨迹查询 旅行时间 网格索引 终止规则 

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