基于位置的可拼接轨迹对搜索
Splicing Trajectory Pairs Search Based on Location

移动设备的快速发展，生成了大量轨迹.基于位置的轨迹搜索，是指给定一组查询点，从数据集中检索top-k条轨迹，但是所得到的轨迹可能不能近距离通过所有查询点.利用轨迹可拼接的想法，提出基于位置的可拼接轨迹对搜索，使用户利用轨迹对得到的轨迹更加近距离地通过所有查询点.在搜索终止过程，给出可拼接的轨迹对搜索过程的有效终止条件.真实的数据集验证了所提方法的有效性.
With the proliferation of mobile devices,a large number of trajectories are generated.Location-based trajectory search is to find the top-k trajectories from a database,given a small set of locations.However,the returned trajectory may not go through all locations as close as possible.Location-based splicing trajectories pair search was proposed based on the idea that trajectory could be spliced to help users to get closer trajectory to all the query points.In the termination of search process,an effective termination condition of the search process was given for splicing trajectory pairs.At last,the effectiveness and efficiency of the proposed algorithm were verified based on the real data set