Nearest neighbor and reverse nearest neighbor queries for moving objects

2003 ◽  
Author(s):  
R. Benetis ◽  
C.S. Jensen ◽  
G. Karciauskas ◽  
S. Saltenis
Keyword(s):  
Moving Objects ◽  
Nearest Neighbor ◽  
Reverse Nearest Neighbor ◽  
Nearest Neighbor Queries

Nearest and reverse nearest neighbor queries for moving objects

2006 ◽  
Vol 15 (3) ◽  
pp. 229-249 ◽  
Author(s):  
Rimantas Benetis ◽  
Christian S. Jensen ◽  
Gytis Karĉiauskas ◽  
Simonas Ŝaltenis
Keyword(s):  
Moving Objects ◽  
Nearest Neighbor ◽  
Reverse Nearest Neighbor ◽  
Nearest Neighbor Queries

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

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.

Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data

2010 ◽  
Vol 22 (4) ◽  
pp. 550-564 ◽  
Author(s):  
Muhammad Aamir Cheema ◽  
Xuemin Lin ◽  
Wei Wang ◽  
Wenjie Zhang ◽  
Jian Pei
Keyword(s):  
Nearest Neighbor ◽  
Uncertain Data ◽  
Reverse Nearest Neighbor ◽  
Nearest Neighbor Queries

scholarly journals REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION

2011 ◽  
Vol 21 (02) ◽  
pp. 179-188 ◽  
Author(s):  
OTFRIED CHEONG ◽  
ANTOINE VIGNERON ◽  
JUYOUNG YON
Keyword(s):  
Data Structure ◽  
Nearest Neighbor ◽  
Dimensional Euclidean Space ◽  
Query Point ◽  
Reverse Nearest Neighbor ◽  
Input Point ◽  
Fixed Dimension ◽  
Nearest Point ◽  
Point Set ◽  
Nearest Neighbor Queries

Reverse nearest neighbor queries are defined as follows: Given an input point set P, and a query point q, find all the points p in P whose nearest point in P ∪ {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O( log n).

Continuous K Nearest Neighbor Queries over Moving Objects Based on Multi-Core and Multi- Threading

2011 ◽  
Vol 22 (8) ◽  
pp. 1805-1815 ◽  
Author(s):  
Liang ZHAO ◽  
Ning JING ◽  
Luo CHEN ◽  
Wei LIAO ◽  
Zhi-Nong ZHONG
Keyword(s):  
Moving Objects ◽  
Nearest Neighbor ◽  
Nearest Neighbor Queries
Sign in / Sign up

Export Citation Format

Share Document