Journal on Communications ›› 2018, Vol. 39 ›› Issue (4): 112-122.doi: 10.11959/j.issn.1000-436x.2018063

• Papers • Previous Articles     Next Articles

k nearest neighbor pattern match queries over spatio-temporal label trajectories

Jianqiu XU,Junxiu LIANG,Xiaolin QIN   

  1. College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China
  • Online:2018-04-01 Published:2018-04-29
  • Supported by:
    The Central University Basic Business Expenses Special Funding for Scientific Research Projects(NS2017073)

Abstract:

Spatio-temporal label trajectories extended traditional spatio-temporal trajectories with semantic labels.k nearest neighbor pattern match was proposed to return the k nearest trajectories that fulfilled the temporal pattern condition.The Label R-Tree (LR-Tree for short) was proposed,which appending a label table and adding label bitmap in each entry,and k nearest neighbor pattern match query algorithm based on LR-Tree was designed.Using both real and synthetic datasets,the LR-Tree was extensively evaluated in comparison with 3DR-Tree,SETI and TB-Tree.The experimental results demonstrate that LR-Tree showing better pruning ability,and verify the effectiveness of proposed algorithm and index.

Key words: spatio-temporal label trajectories, k nearest neighbor algorithm, pattern match, index

CLC Number: 

No Suggested Reading articles found!