摘要

An indexing structure TPR tree (Time-Parameterized R-tree) and basic nearest neighbor queries are introduced in this paper. The concept of "influence time" is given and it is used in nearest neighbor queries algorithms to implement continuous nearest neighbor queries for moving objects, and finally the quality of the two continuous nearest neighbor query algorithms are tested and compared with extensive experiments.