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
2009 ◽  
Vol 18 (5) ◽  
pp. 1219-1240 ◽  
Author(s):  
Jinchuan Chen ◽  
Reynold Cheng ◽  
Mohamed Mokbel ◽  
Chi-Yin Chow

2011 ◽  
Vol 21 (02) ◽  
pp. 179-188 ◽  
Author(s):  
OTFRIED CHEONG ◽  
ANTOINE VIGNERON ◽  
JUYOUNG YON

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).


2010 ◽  
Vol 33 (10) ◽  
pp. 1943-1952
Author(s):  
Yan-Qiu WANG ◽  
Chuan-Fei XU ◽  
Ge YU ◽  
Yu GU ◽  
Mo CHEN

2006 ◽  
Vol 15 (3) ◽  
pp. 229-249 ◽  
Author(s):  
Rimantas Benetis ◽  
Christian S. Jensen ◽  
Gytis Karĉiauskas ◽  
Simonas Ŝaltenis

2011 ◽  
Vol 4 (10) ◽  
pp. 669-680 ◽  
Author(s):  
Thomas Bernecker ◽  
Tobias Emrich ◽  
Hans-Peter Kriegel ◽  
Matthias Renz ◽  
Stefan Zankl ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document