The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A cost model for similarity queries in metric spaces
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
LOF: identifying density-based local outliers
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient algorithms for mining outliers from large data sets
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
An Index Structure for Efficient Reverse Nearest Neighbor Queries
Proceedings of the 17th International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
C2P: Clustering based on Closest Pairs
Proceedings of the 27th International Conference on Very Large Data Bases
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Reverse kNN search in arbitrary dimensionality
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Dynamic skyline queries in metric spaces
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
FINCH: evaluating reverse k-Nearest-Neighbor queries on location data
Proceedings of the VLDB Endowment
Efficient algorithms for reverse proximity query problems
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Reverse k-nearest neighbor search in dynamic and general metric databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Incremental Reverse Nearest Neighbor Ranking in Vector Spaces
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Constrained reverse nearest neighbor search on mobile objects
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Lazy updates: an efficient technique to continuously monitoring reverse kNN
Proceedings of the VLDB Endowment
High-dimensional kNN joins with incremental updates
Geoinformatica
Reverse k-Nearest Neighbor monitoring on mobile objects
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
The inverse classification problem
Journal of Computer Science and Technology
On multi-type reverse nearest neighbor search
Data & Knowledge Engineering
On efficient obstructed reverse nearest neighbor query processing
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Reverse-k-Nearest-Neighbor join processing
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
DART: an efficient method for direction-aware bichromatic reverse k nearest neighbor queries
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Given a set {\cal D} of objects, a reverse nearest neighbor (RNN) query returns the objects o in {\cal D} such that o is closer to a query object q than to any other object in {\cal D}, according to a certain similarity metric. The existing RNN solutions are not sufficient because they either 1) rely on precomputed information that is expensive to maintain in the presence of updates or 2) are applicable only when the data consists of "Euclidean objects” and similarity is measured using the L_2 norm. In this paper, we present the first algorithms for efficient RNN search in generic metric spaces. Our techniques require no detailed representations of objects, and can be applied as long as their mutual distances can be computed and the distance metric satisfies the triangle inequality. We confirm the effectiveness of the proposed methods with extensive experiments.