An Efficient Algorithm for Continuous Nearest Neighbor Queries Based on the VDTPR-Tree

With the advances in mobile communication and position-finding technology for tracking the positions of continuously moving objects, there comes a kind of novel applications (e.g., traffic control, meteorology monitoring, mobile computing, etc.) in which the locations of moving objects need to be maintained and processed. In these applications, algorithms for efficiently answering queries involved in a great number of moving objects are becoming increasingly important. One such kind of queries is the continuous nearest neighbor queries. The TPR-tree is a popular indexing method for continuous nearest neighbor query processing, however, its query performance suffer a sharp decline with the increase of time.