Presentation information

Organized Session

Organized Session » OS-7

[2C4-OS-7a] OS-7 (1)

Wed. Jun 10, 2020 1:50 PM - 3:30 PM Room C (jsai2020online-3)

藤井 慶輔(名古屋大学)、竹内 孝(NTT)、竹内 一郎(名古屋工業大学)、田部井 靖生(理化学研究所)、依田 憲(名古屋大学)、前川 卓也(大阪大学)

1:50 PM - 2:10 PM

[2C4-OS-7a-01] Succinct Trie Index for Fast and Memory-Efficient Trajectory Similarity Search

〇Shunsuke Kanda1, Koh Takeuchi2, Keisuke Fujii3,1, Yasuo Tabei1 (1. RIKEN Center for Advanced Intelligence Project, 2. Kyoto University, 3. Nagoya University)

Keywords:Trajectory Similarity Search, Succinct Data Structures

This paper proposes an efficient similarity search method for massive collections of trajectories. This method enables fast similarity searches by leveraging locality sensitive hashing and tries. To achieve memory efficiency, we propose two novel techniques of node reduction and a space-efficient representation for tries. We experimentally test our method on its ability to retrieve similar trajectories for a query from large collections of trajectories and show that our method performs superiorly with respect to search time and memory efficiency.

Authentication for paper PDF access

A password is required to view paper PDFs. If you are a registered participant, please log on the site from Participant Log In.
You could view the PDF with entering the PDF viewing password bellow.