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
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
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
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Minimum Redundancy Feature Selection from Microarray Gene Expression Data
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Reverse kNN search in arbitrary dimensionality
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximate reverse k-nearest neighbor queries in general metric spaces
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Efficient computation of reverse skyline queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Meta-adaptation: neurons that change their mode
NN'08 Proceedings of the 9th WSEAS International Conference on Neural Networks
ELKI: A Software System for Evaluation of Subspace Clustering Algorithms
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
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
Modal learning neural networks
WSEAS Transactions on Computers
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
Efficient skyline computation in metric space
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
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
Towards solving similarity search problems using fuzzy concept for multi-dimensional data
Proceedings of the 47th Annual Southeast Regional Conference
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
A flexible framework to ease nearest neighbor search in multidimensional data spaces
Data & Knowledge Engineering
High-dimensional kNN joins with incremental updates
Geoinformatica
K-nearest neighbor search for fuzzy objects
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Reverse k-Nearest Neighbor monitoring on mobile objects
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
An efficient algorithm for reverse furthest neighbors query with metric index
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Towards improving a similarity search approach
Proceedings of the 48th Annual Southeast Regional Conference
Efficient RkNN retrieval with arbitrary non-metric similarity measures
Proceedings of the VLDB Endowment
Efficient reverse skyline retrieval with arbitrary non-metric similarity measures
Proceedings of the 14th International Conference on Extending Database Technology
Reverse spatial and textual k nearest neighbor search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
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
Shared execution strategy for neighbor-based pattern mining requests over streaming windows
ACM Transactions on Database Systems (TODS)
Incremental connectivity-based outlier factor algorithm
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Clustering algorithm based on mutual K-nearest neighbor relationships
Statistical Analysis and Data Mining
An efficient algorithm for arbitrary reverse furthest neighbor queries
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Spatial query processing for fuzzy objects
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 |
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the reverse 1-nearest neighbor problem which has received increasing attention recently. Many industrial and scientific applications call for solutions of the RkNN problem in arbitrary metric spaces where the data objects are not Euclidean and only a metric distance function is given for specifying object similarity. Usually, these applications need a solution for the generalized problem where the value of k is not known in advance and may change from query to query. However, existing approaches, except one, are designed for the specific R1NN problem. In addition - to the best of our knowledge - all previously proposed methods, especially the one for generalized RkNN search, are only applicable to Euclidean vector data but not for general metric objects. In this paper, we propose the first approach for efficient RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our approach uses the advantages of existing metric index structures but proposes to use conservative and progressive distance approximations in order to filter out true drops and true hits. In particular, we approximate the k-nearest neighbor distance for each data object by upper and lower bounds using two functions of only two parameters each. Thus, our method does not generate any considerable storage overhead. We show in a broad experimental evaluation on real-world data the scalability and the usability of our novel approach.