Sub-trajectory Similarity Join with Obfuscation
Yanchuan Chang, Jianzhong Qi, Egemen Tanin, Xingjun Ma, Hanan Samet

TL;DR
This paper introduces a privacy-preserving distributed method for sub-trajectory similarity join queries, enabling analysis of partial trajectory similarities crucial for applications like epidemic contact tracing.
Contribution
It proposes a novel distributed index and query algorithm for sub-trajectory similarity join that preserves user privacy through obfuscation.
Findings
Effective and efficient index structure demonstrated
Preserves user privacy with obfuscated data
Validated on real-world trajectory data
Abstract
User trajectory data is becoming increasingly accessible due to the prevalence of GPS-equipped devices such as smartphones. Many existing studies focus on querying trajectories that are similar to each other in their entirety. We observe that trajectories partially similar to each other contain useful information about users' travel patterns which should not be ignored. Such partially similar trajectories are critical in applications such as epidemic contact tracing. We thus propose to query trajectories that are within a given distance range from each other for a given period of time. We formulate this problem as a sub-trajectory similarity join query named as the STS-Join. We further propose a distributed index structure and a query algorithm for STS-Join, where users retain their raw location data and only send obfuscated trajectories to a server for query processing. This helps…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
