Research in Continuous Nearest Neighbor Queries

摘要：

This paper analyzes several methods of the present continuous nearest neighbor queries and proposes a query algorithm based on R – tree through the geometric feature of this problem, the algorithms can not only avoid the loss of dividing points and high cost of the query, but also can finish the continuous nearest neighbor query for moving objects effectively.

关键词： Minimum boundary rectangle(MBR) TPR tree Continuous nearest neighbor query

作者: Yingjie Wang

作者单位: College of Information Engineering, Dalian University, Dalian 116622, P. R. China

会议类型: 国际会议

会议名称: 2011 International Conference on Advanced Materials and Engineering Materials(2011先进材料与工程材料国际会议 ICAMEM 2011)

会议地点: 沈阳

会议语种:英文

页码: 461-466

在线出版日期: 2011-11-22（万方平台首次上网日期，不代表论文的发表时间）