通信学报 ›› 2018, Vol. 39 ›› Issue (4): 112-122.doi: 10.11959/j.issn.1000-436x.2018063

• 学术论文 • 上一篇    下一篇

基于时空标签轨迹的k近邻模式匹配查询

许建秋,梁珺秀,秦小麟   

  1. 南京航空航天大学计算机科学与技术学院,江苏 南京 211106
  • 出版日期:2018-04-01 发布日期:2018-04-29
  • 作者简介:许建秋(1982-),男,江苏南京人,博士,南京航空航天大学副教授,主要研究方向为移动对象数据库。|梁珺秀(1994-),女,江西抚州人,南京航空航天大学硕士生,主要研究方向为移动对象数据库。|秦小麟(1953-),男,江苏南京人,博士,南京航空航天大学教授,主要研究方向为安全数据库、时空数据库、分布式环境数据管理与安全等。
  • 基金资助:
    中央高校基本科研业务费专项基金资助项目(NS2017073)

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)

摘要:

时空标签轨迹在传统的时空轨迹数据基础之上融入了具有语义含义的标签信息,丰富了移动对象数据。针对该数据提出k近邻模式匹配查询,即在给定时间区间内匹配相应的模式且距离查询轨迹最近的k条轨迹。设计并实现标签R树(LR-Tree),即增加标签表并在R树每项中添加标签位图,及基于LR-Tree的k近邻模式匹配查询算法。通过真实数据和合成数据将LR-Tree与3DR-Tree、SETI及TB-Tree进行对比,实验表明LR-Tree具有更好的剪枝能力,从而验证了所提算法及索引的有效性。

关键词: 时空标签轨迹, k近邻算法, 模式匹配, 索引

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

中图分类号: 

No Suggested Reading articles found!