arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.04503cs.DB
收藏

有效的轨迹压缩和范围查询处理

Efficient Trajectory Compression and Range Query Processing

Hongbo Yin, Hong Gao, Binghao Wang, Sirui Li, Jianzhong Li

摘要:

如今,GPS传感器在各种设备中无处不在,收集,传输和存储大量的轨迹数据。然而,如此大规模的GPS数据不仅对有效的存储机制提出了迫切的需求,而且对高效的查询机制也提出了迫切的需求。在线模式下的直线简化搜索作为一种主流的轨迹压缩方法,对解决这一问题起到了重要作用。但现有的算法要么时间开销太大,要么压缩后的精度损失太大。为了解决这个问题,我们提出了$ε\_$基于区域的误差有界在线轨迹压缩(ROCE),它使准确率损失,时间成本和压缩率之间的最佳平衡。范围查询是分析轨迹的一个基本但非常重要的操作。每个轨迹通常被看作是一个离散点的序列,在大多数以前的工作中,一个轨迹被判断为与查询区域R重叠,如果在这个轨迹中至少有一个点落在R。但是当查询轨迹被压缩时,这种传统的准则并不适用,因为每两个相邻的点之间可能有数百个点被丢弃,并且每个压缩轨迹中的点是相当稀疏的。结果集中可能缺少许多轨迹。针对这一问题,本文提出了一种基于概率的新准则和一种有效的压缩轨迹RQC范围查询处理算法。此外,本文还提出了一个高效的索引\emph{ASP\_tree}和一系列新的技术,显著地加快了轨迹压缩和距离查询的处理速度。在多个真实数据集上进行了大量的实验,结果表明我们的方法具有优越的性能。

英文摘要:

Nowadays, there are ubiquitousness of GPS sensors in various devices collecting, transmitting and storing tremendous trajectory data. However, such an unprecedented scale of GPS data has posed an urgent demand for not only an effective storage mechanism but also an efficient query mechanism. Line simplification in online mode, searving as a mainstream trajectory compression method, plays an important role to attack this issue. But for the existing algorithms, either their time cost is extremely high, or the accuracy loss after the compression is completely unacceptable. To attack this issue, we propose $ε\_$Region based Online trajectory Compression with Error bounded (ROCE for short), which makes the best balance among the accuracy loss, the time cost and the compression rate. The range query serves as a primitive, yet quite essential operation on analyzing trajectories. Each trajectory is usually seen as a sequence of discrete points, and in most previous work, a trajectory is judged to be overlapped with the query region R iff there is at least one point in this trajectory falling in R. But this traditional criteria is not suitable when the queried trajectories are compressed, because there may be hundreds of points discarded between each two adjacent points and the points in each compressed trajectory are quite sparse. And many trajectories could be missing in the result set. To address this, in this paper, a new criteria based on the probability and an efficient Range Query processing algorithm on Compressed trajectories RQC are proposed. In addition, an efficient index \emph{ASP\_tree} and lots of novel techniques are also presented to accelerate the processing of trajectory compression and range queries obviously. Extensive experiments have been done on multiple real datasets, and the results demonstrate superior performance of our methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑