The Community for Technology Leaders
Green Image
Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q?s influence on a data point p (∈ P) is denoted by κp where q is the κp-th NN of p. We introduce a new variant of RNN query, namely, Ranked Reverse Nearest Neighbor (RRNN) query, that retrieves t data points most influenced by q, i.e., the t data points having the smallest κ?s with respect to q. To answer this RRNN query efficiently, we propose two novel algorithms, κ-Counting and κ-Browsing that are applicable to both monochromatic and bichromatic scenarios and are able to deliver results progressively. Through an extensive performance evaluation, we validate that the two proposed RRNN algorithms are superior to solutions derived from algorithms designed for RkNN query.
Database, Query Processing, Algorithms, Nearest Neighbor, Reverse Nearest Neighbor

K. C. Lee, B. Zheng and W. Lee, "Ranked Reverse Nearest Neighbor Search," in IEEE Transactions on Knowledge & Data Engineering, vol. 20, no. , pp. 894-910, 2008.
86 ms
(Ver 3.3 (11022016))