Trip Oriented Search on Activity Trajectory
Trip Oriented Search on Activity Trajectory
复制标题
DOI:
10.1007/s11390-015-1558-6
复制
发表时间:
2015-07
影响因子:
0.7
通讯作者:
Wei Chen-;Lei Zhao;Jiajie Xu;Guanfeng Liu;Kai Zheng;Xiaofang Zhou
中科院分区:
文献类型:
--
作者:
Wei Chen-;Lei Zhao;Jiajie Xu;Guanfeng Liu;Kai Zheng;Xiaofang Zhou
Driven by the flourish of location-based services, trajectory search has received significant attentions in recent years. Different from existing studies that focus on searching trajectories with spatio-temporal information and text de-scriptions, we study a novel problem of searching trajectories with spatial distance, activities, and rating scores. Given a queryqwith a threshold of distance, a set of activities, a start pointSand a destinationE, trip oriented search on activity trajectory (TOSAT) returnsktrajectories that can cover the activities with the highest rating scores within the threshold of distance. In addition, we extend the query with an order, i.e., order-sensitive trip oriented search on activity trajectory (OTOSAT), which takes both the order of activities in a queryqand the order of trajectories into consideration. It is very challenging to answer TOSAT and OTOSAT efficiently due to the structural complexity of trajectory data with rating information. In order to tackle the problem efficiently, we develop a hybrid index AC-tree to organize trajectories. Moreover, the optimized variant RAC+-tree and novel algorithms are introduced with the goal of achieving higher performance. Extensive experiments based on real trajectory datasets demonstrate that the proposed index structures and algorithms are capable of achieving high efficiency and scalability.