作者: Peng Zhao , Weixiong Rao , Chengxi Zhang , Gong Su , Qi Zhang
DOI: 10.1007/S10707-020-00405-Y
关键词:
摘要: The volume of trajectory data has become tremendously large in recent years. How to effectively and efficiently search similar trajectories an important task. Firstly, measure the similarity between a query, literature works compute spatial temporal independently, next sum two weighted similarities. Thus, with high low will have same overall another similarity. To overcome this issue, we propose by synchronously matching distance against distance. Secondly, given new measurement, challenge searching top-k over huge database non-trivial number query points, answer following techniques: grid indexing partitioning. performance our proposed algorithms is studied extensive experiments based on real sets.