K-Aggregate Nearest Neighbor Query Method of Moving Objects in Road Networks

2016 ◽  
Vol 9 (4) ◽  
pp. 151-160 ◽  
Author(s):  
Chen Wen
Keyword(s):  
Moving Objects ◽  
Nearest Neighbor ◽  
Road Networks ◽  
Nearest Neighbor Query ◽  
Aggregate Nearest Neighbor

On Efficient Aggregate Nearest Neighbor Query Processing in Road Networks

2015 ◽  
Vol 30 (4) ◽  
pp. 781-798 ◽  
Author(s):  
Wei-Wei Sun ◽  
Chu-Nan Chen ◽  
Liang Zhu ◽  
Yun-Jun Gao ◽  
Yi-Nan Jing ◽  
...  
Keyword(s):  
Query Processing ◽  
Nearest Neighbor ◽  
Road Networks ◽  
Nearest Neighbor Query ◽  
Aggregate Nearest Neighbor

Continuous K Nearest Neighbor Queries of Moving Objects in Road Networks

2010 ◽  
Vol 33 (8) ◽  
pp. 1396-1404 ◽  
Author(s):  
Liang ZHAO ◽  
Luo CHEN ◽  
Ning JING ◽  
Wei LIAO
Keyword(s):  
Moving Objects ◽  
Nearest Neighbor ◽  
Road Networks ◽  
Nearest Neighbor Queries

NNlists-based k-path nearest neighbor query in road networks

2010 ◽  
Vol 30 (7) ◽  
pp. 1947-1949
Author(s):  
Bao-wen WANG ◽  
Jing-jing HAN ◽  
Zi-jun CHEN ◽  
Wen-yuan LIU
Keyword(s):  
Nearest Neighbor ◽  
Road Networks ◽  
Nearest Neighbor Query

Research in Continuous Nearest Neighbor Queries

2012 ◽  
Vol 457-458 ◽  
pp. 461-466
Author(s):  
Ying Jie Wang
Keyword(s):  
Moving Objects ◽  
Nearest Neighbor ◽  
Geometric Feature ◽  
Nearest Neighbor Query ◽  
Query Algorithm ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document