Research in Continuous Nearest Neighbor Queries

2012 ◽  
Vol 457-458 ◽  
pp. 461-466
Author(s):  
Ying Jie Wang

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.

2010 ◽  
Vol 33 (8) ◽  
pp. 1396-1404 ◽  
Author(s):  
Liang ZHAO ◽  
Luo CHEN ◽  
Ning JING ◽  
Wei LIAO

2011 ◽  
Vol 22 (8) ◽  
pp. 1805-1815 ◽  
Author(s):  
Liang ZHAO ◽  
Ning JING ◽  
Luo CHEN ◽  
Wei LIAO ◽  
Zhi-Nong ZHONG

2011 ◽  
pp. 204-224
Author(s):  
Katerina Raptopoulou ◽  
Apostolos N. Papadopoulos ◽  
Yannis Manolopoulos

The efficient processing of nearest-neighbor queries in databases of moving objects is considered very important for applications such as fleet management, traffic control, digital battlefields and more. Such applications have been rapidly spread due to the fact that mobile computing and wireless technologies nowadays are ubiquitous. This chapter presents important aspects towards simple and incremental nearest-neighbor search for spatio-temporal databases. More specifically, we describe the algorithms that have already been proposed for simple and incremental nearest neighbor queries and present a new algorithm regarding that issue. Finally, we study the problem of keeping a query consistent in the presence of insertions, deletions and updates of moving objects.


Sign in / Sign up

Export Citation Format

Share Document