Approximate reverse k-nearest neighbor queries in general metric spaces

In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approximation of the nearest-neighbor-distances in order to prune the search space. In several experiments, our solution scales significantly better than existing non-approximative approaches while producing an approximation of the true query result with a high recall. Categories and Subject Descriptors: H.2.2 [Physical Design]: Access methods General Terms: Algorithms, Performance

• Type: Conference
• Year: 2006
• Where: CIKM
• Authors: Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz
• Keywords: Arbitrary Metric Spaces, CIKM 2006, Efficient Approximative Rknn, Information Management, Query Time