Parallel Semantic Trajectory Similarity Join
Lisi Chen, Shuo Shang, Christian S. Jensen, Bin Yao, Panos Kalnis
Abstract
Matching similar pairs of trajectories, called trajectory similarity join, is a fundamental functionality in spatial data management. We consider the problem of semantic trajectory similarity join (STS-Join). Each semantic trajectory is a sequence of Points-of-interest (POIs) with both location and text information. Thus, given two sets of semantic trajectories and a threshold θ, the STS-Join returns all pairs of semantic trajectories from the two sets with spatio-textual similarity no less than θ. This join targets applications such as term-based trajectory near-duplicate detection, geo-text data cleaning, personalized ridesharing recommendation, keyword-aware route planning, and travel itinerary recommendation.With these applications in mind, we provide a purposeful definition of spatio-textual similarity. To enable efficient STS-Join processing on large sets of semantic trajectories, we develop trajectory pair filtering techniques and consider the parallel processing capabilities of modern processors. Specifically, we present a two-phase parallel search algorithm. We first group semantic trajectories based on their text information. The algorithm's per-group searches are independent of each other and thus can be performed in parallel. For each group, the trajectories are further partitioned based on the spatial domain. We generate spatial and textual summaries for each trajectory batch, based on which we develop batch filtering and trajectory-batch filtering techniques to prune unqualified trajectory pairs in a batch mode. Additionally, we propose an efficient divide-and-conquer algorithm to derive bounds of spatial similarity and textual similarity between two semantic trajectories, which enable us prune dissimilar trajectory pairs without the need of computing the exact value of spatio-textual similarity. Experimental study with large semantic trajectory data confirms that our algorithm of processing semantic trajectory join is capable of outperforming our well-designed baseline by a factor of 8-12.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get d7d64209-09ea-4bd8-b62c-13e1e6a8d46eCited by top-tier papers4
- A Graph-based Approach for Trajectory Similarity Computation in Spatial NetworksPeng Han, Jin Wang, Di Yao, Shuo Shang et al.KDD 2021 · 119 citations
- Towards Efficient Selection of Activity Trajectories based on Diversity and CoverageChengcheng Yang, Lisi Chen, Hao Wang, Shuo ShangAAAI 2021 · 29 citations
- Parallel Online Similarity Join over Trajectory StreamsZhongjun Ding, Ke Li, Lisi Chen, Shuo ShangWWW 2025 · 5 citations
- Learning Generalized and Flexible Trajectory Models from Omni-Semantic SupervisionYuanshao Zhu, James Jianqiao Yu, Xiangyu Zhao, Xiao Han et al.KDD 2025 · 2 citations
Related papers
- Ghost: A General Framework for High-Performance Online Similarity Queries over Distributed Trajectory StreamsZiquan Fang, Shenghao Gong, Lu Chen, Jiachen Xu et al.SIGMOD 2023 · 12 citations
- Real-Time Route Search by LocationsLisi Chen, Shuo Shang, Tao GuoAAAI 2020 · 24 citations
- Fast Subtrajectory Similarity Search in Road Networks under Weighted Edit Distance ConstraintsSatoshi Koide, Chuan Xiao, Yoshiharu IshikawaVLDB 2020 · 32 citations
- Spatial-Temporal Similarity for Trajectories with Location Noise and Sporadic SamplingGuanyao Li, Chih-Chieh Hung, Mengyun Liu, Linfei Pan et al.ICDE 2021 · 17 citations
- TraSS: Efficient Trajectory Similarity Search Based on Key-Value Data StoresHuajun He, Ruiyuan Li, Sijie Ruan, Tianfu He et al.ICDE 2022 · 22 citations
