【24h】

Compact Trip Representation over Networks

机译:网络上的紧凑行程表示

获取原文
获取外文期刊封面目录资料

摘要

We present a new Compact Trip Representation (CTR) that allows us to manage users' trips (moving objects) over networks. These could be public transportation networks (buses, subway, trains, and so on) where nodes are stations or stops, or road networks where nodes are intersections. CTR represents the sequences of nodes and time instants in users' trips. The spatial component is handled with a data structure based on the well-known Compressed Suffix Array (CSA), which provides both a compact representation and interesting indexing capabilities. We also represent the temporal component of the trips, that is, the time instants when users visit nodes in their trips. We create a sequence with these time instants, which are then self-indexed with a balanced Wavelet Matrix (WM). This gives us the ability to solve range-interval queries efficiently. We show how CTR can solve relevant spatial and spatio-temporal queries over large sets of trajectories. Finally, we also provide experimental results to show the space requirements and query efficiency of CTR.
机译:我们提出了一种新的紧凑行程表示法(CTR),使我们能够通过网络管理用户的行程(移动对象)。这些可以是节点为车站或车站的公交网络(公共汽车,地铁,火车等),也可以是节点为十字路口的道路网络。点阅率代表使用者行程中节点和时间点的顺序。使用基于众所周知的压缩后缀数组(CSA)的数据结构处理空间分量,该结构提供紧凑的表示形式和有趣的索引功能。我们还表示行程的时间部分,即用户访问行程中的节点的时刻。我们用这些时刻创建一个序列,然后用平衡的小波矩阵(WM)自索引。这使我们能够有效地解决范围间隔查询。我们将展示CTR如何解决大型轨迹集上的相关空间和时空查询。最后,我们还提供了实验结果,以显示点击率的空间要求和查询效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号