Ghost: A General Framework for High-Performance Online Similarity Queries over Distributed Trajectory Streams
Ziquan Fang, Shenghao Gong, Lu Chen, Jiachen Xu, Yunjun Gao, Christian S. Jensen
Abstract
Trajectory similarity queries, including similarity search and similarity join, offer a foundation for many geo-spatial applications. With the rapid increase of streaming trajectory data volumes, e.g., data from mobile phones, vessel monitoring, or traffic systems, many location-based services benefit from online similarity analytics over trajectory data streams, where moving objects continually emit real-time position data. However, most existing studies focus on offline settings, and thus several major challenges remain unanswered in an online setting. To this end, we describe Ghost, a distributed stream processing framework that enables generic, efficient, and scalable online trajectory similarity search and join. We propose a novel incremental online similarity computation (IOSC) mechanism to accelerate pair-wise streaming trajectory distance calculation, which supports a broad range of trajectory distance metrics. Compared with previous studies, IOSC reduces the complexity from quadratic to linear in terms of trajectory length. Building on this foundation, we propose histogram-based algorithms that exploit histogram indexes and a series of pruning bounds to enable streaming trajectory similarity search and join. Finally, we extend our methods to the distributed platform Flink for scalability, where a CostPartitioner is developed to ensure parallel processing and workload balancing. An experimental study using two real-life and one synthetic datasets shows that Ghost (i) acquires 6-20× efficiency/throughput gains and one order of magnitude memory overhead savings over state-of-the-art baselines, (ii) achieves 3--8× workload balancing gains on Flink, and (iii) exhibits low parameter sensitivity and high robustness.
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 b737b5a9-32b8-439c-93a4-403b662eec6fCited by top-tier papers4
- Efficient Methods for Accurate Sparse Trajectory Recovery and Map MatchingWei Tian, Jieming Shi, Man Lung YiuICDE 2025 · 5 citations
- Parallel Online Similarity Join over Trajectory StreamsZhongjun Ding, Ke Li, Lisi Chen, Shuo ShangWWW 2025 · 5 citations
- T-Assess: An Efficient Data Quality Assessment System Tailored for Trajectory DataJunhao Zhu, Tao Wang, Danlei Hu, Ziquan Fang et al.VLDB 2025 · 2 citations
- Towards Robust Trajectory Embedding for Similarity Computation: When Triangle Inequality Violations in Distance Metrics MatterJianing Si, Haitao Yuan, Nan Jiang, Minxiao Chen et al.ICDE 2025 · 2 citations
Related papers
- REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point TriesBolong Zheng, Lianggui Weng, Xi Zhao, Kai Zeng et al.ICDE 2021 · 22 citations
- Beyond Locations: A Motion Range-Aware Similarity JoinKe Li, Lisi Chen, Shuo Shang, Christian S. Jensen et al.KDD 2025
- TraSS: Efficient Trajectory Similarity Search Based on Key-Value Data StoresHuajun He, Ruiyuan Li, Sijie Ruan, Tianfu He et al.ICDE 2022 · 22 citations
- Parallel Semantic Trajectory Similarity JoinLisi Chen, Shuo Shang, Christian S. Jensen, Bin Yao et al.ICDE 2020 · 58 citations
- TRACE: Real-time Compression of Streaming Trajectories in Road NetworksTianyi Li, Lu Chen, Christian S. Jensen, Torben Bach PedersenVLDB 2021 · 73 citations
