Reverse k-nearest neighbor search in dynamic and general metric databases

In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN search, our approach works on top of any hierarchically organized tree-like index structure and, thus, is applicable to any type of data as long as a metric distance function is defined on the data objects. We will exemplarily show how our approach works on top of the most prevalent index structures for Euclidean and metric data, the R-Tree and the M-Tree, respectively. Our solution is applicable for arbitrary values of k and can also be applied in dynamic environments where updates of the database frequently occur. Although being the most general solution for the RkNN problem, our solution outperforms existing methods in terms of query execution times because it exploits different strategies for pruning false drops and identifying true hits as soon as possible.

• Type: Conference
• Year: 2009
• Where: EDBT
• Authors: Elke Achtert, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle
• Keywords: EDBT 2009, Index Structures, Reverse K-nearest Neighbor, Solution