计算机科学 ›› 2012, Vol. 39 ›› Issue (Z11): 149-153.

• 软件工程 • 上一篇    下一篇

基于动态距离的近邻查询算法研究

成莎莎,蒋夏军,皮德常   

  1. (南京航空航天大学计算机科学与技术学院 南京210016)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Research on Nearest Neighbor Query Based on Temporal Distance

  • Online:2018-11-16 Published:2018-11-16

摘要: 移动对象轨迹数据的挖掘是移动对象数据库的一个重要研究方向,从轨迹数据中得到的信息可以应用到交通控制、气候预测以及生态研究等多个方面。基于轨迹数据形式化定义时态距离,用相对简单的近似距离替代精确距离来减少查询过程中的计算量。在关系模型和树结构模型上,实现基于动态距离的距离查询、时间点最近部查询和时间段最近邻查询算法并对查询效率加以比较。实验结果表明,树模型的查询效率明显高于关系模型。最后在树结构模型中引入嵌入式索引进一步提高了查询效率。

关键词: 移动对象,时态距离,最近邻查询,树模型,嵌入式索引

Abstract: The mining technique of moving objects trajectory data is one of the important research branches of moving objects databases, and information derived from trajectory data can be applied to traffic control, climate forecast, ecological study and so on. A formal definition of temporal distance based on the trajectory data is provided firstly,and in order to decreasing the amount of computation in the process of query, this paper uses a relatively simple approximate distance to replace accurate distance. Distance query,instant nearest neighbor query and interval nearest neighbor query based on temporal distance arc implemented on relational model and tree structure. I}he query efficiency of two models is also compared, and the experimental results show that tree structure has better efficiency. In order to further improve the efficiency, this paper adopts embedded index in the tree structure model.

Key words: Moving objects, Temporal distance, Nearest neighbor qucry,Tree structure, Embedded index

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!