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
中科院分区:
--
文献类型:
--
作者:
Wei Chen-;Lei Zhao;Jiajie Xu;Guanfeng Liu;Kai Zheng;Xiaofang Zhou

文献摘要

被引文献

相似文献

随着基于位置的服务的蓬勃发展,轨迹搜索近年来受到了广泛的关注。与现有的基于时空信息和文本去重的轨迹搜索方法不同,本文研究了一种基于空间距离、活动和评分的轨迹搜索方法。给定具有距离阈值的查询q、一组活动、起点和目的地E,基于活动轨迹的面向行程的搜索(TOSAT)返回可以覆盖距离阈值内具有最高评级分数的活动的轨迹。此外,我们用一个顺序来扩展查询,即,对活动轨迹进行顺序敏感的行程导向搜索(OTOSAT),它同时考虑查询中活动的顺序和轨迹的顺序。由于具有评级信息的轨迹数据的结构复杂性,有效地回答TOSAT和OTOSAT是非常具有挑战性的。为了有效地解决这个问题,我们开发了一个混合索引AC树来组织轨迹。此外,优化的变体RAC+树和新的算法,以实现更高的性能的目标。基于真实的轨迹数据集的大量实验表明,所提出的索引结构和算法能够实现高效率和可扩展性。
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.