Analysis of Reverse k nearest queries

Abstract:
A reverse k-nearest neighbor (RkNN) query returns the data objects that have the query object in
the set of their k-nearest neighbors. It is the complementary problem to that of finding the
k-nearest neighbors (kNN) of a query object. The goal of a reverse k-nearest neighbor query is to
identify the “influence” of a query object on the whole data set. A naive solution of the RkNN
problem requires quadratic time, as the k-nearest neighbors of all of the n objects in the data set
have to be found. RkNN problems have been studied extensively to reduce the time complexity in
identifying the “influence” of a query object. Reverse nearest neighbor queries have received
considerable attention due to their importance in several applications involving decision support,
resource allocation, profile-based marketing, etc.
The main objective of the study is to show how the existing algorithms solve the problem of
quadratic time complexity. This study focuses on both 2-dimentional graph and
multi-dimensional graphs. For 2-dimentional graph pruning-and-verification framework is
adopted. Regions based pruning and half-space pruning are the two most notable pruning
strategies. We observe the weaknesses and strengths of both strategies and identified the research
gap between them. The study also covers the extension of RKNN in any arbitrary dimension and
analyze their state-of-the-art techniques.

References:
1. Reverse k nearest neighbors queries and spatial reverse top-k queries, VLDB, 2017.
2. SLICE: Reviving regions-based pruning for reverse k nearest neighbors queries, 2014
IEEE 30th International Conference on Data Engineering.
3. Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor
Graph, 2009 Second International Workshop on Similarity Search and Applications.
4. Reverse nearest neighbors in large graphs, IEEE Transactions on Knowledge and Data
Engineering ( Volume: 18, Issue: 4, April 2006)
5. Multidimensional reverse kNN search, VLDB, 2007.
6. Reverse kNN search in arbitrary dimensionality, VLDB, 2004.
7. Efficient reverse k-nearest neighbor search in arbitrary metric spaces, SIGMOD '06:
Proceedings of the 2006 ACM SIGMOD international conference on Management of
data.
8. Lazy updates: an efficient technique to continuously monitoring reverse kNN,
Proceedings of the VLDB Endowment, August 2009.
9. Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases, IEEE
Transactions on Knowledge and Data Engineering ( Volume: 21, Issue: 9, Sept. 2009).