摘要
介绍了一种索引结构———TPR树和静态环境中基本的最近邻查询算法,并提出了影响时间这一概念,将其运用到最近邻查询算法中,可以完成移动对象的连续最近邻查询。
An indexing structure-TPR tree(time-parameterized R tree)and basic nearest neighbor queries in static environment are introduced in this paper.The concept of“influence time ”is given and it is used in nearest neighbor queries algorithm to implement continuous nearest neighbor queries for moving objects.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第33期198-200,共3页
Computer Engineering and Applications
关键词
移动对象
TPR树
连续最近邻查询
moving objects,TPR tree,continuous nearest neighbor query
