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
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Processing queries by linear constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
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
Discovery of Influence Sets in Frequently Updated Databases
Proceedings of the 27th 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
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
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
Reverse nearest neighbor aggregates over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Reverse kNN search in arbitrary dimensionality
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient Similarity Search over Future Stream Time Series
IEEE Transactions on Knowledge and Data Engineering
Probabilistic ranked queries in uncertain databases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Monochromatic and bichromatic reverse skyline search over uncertain databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Top-k dominating queries in uncertain databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
On efficient mutual nearest neighbor query processing in spatial databases
Data & Knowledge Engineering
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
Reverse skyline search in uncertain databases
ACM Transactions on Database Systems (TODS)
Efficient mutual nearest neighbor query processing for moving object trajectories
Information Sciences: an International Journal
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
Probabilistic inverse ranking queries in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
Hubs in Space: Popular Nearest Neighbors in High-Dimensional Data
The Journal of Machine Learning Research
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient filter algorithms for reverse k-nearest neighbor query
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Shooting top-k stars in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
An efficient algorithm for arbitrary reverse furthest neighbor queries
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Probabilistic top-k dominating queries in uncertain databases
Information Sciences: an International Journal
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
Monochromatic and bichromatic mutual skyline queries
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such queries have at least one of the following deficiencies: they (i) do not support arbitrary values of k, (ii) cannot deal efficiently with database updates, (iii) are applicable only to 2D data but not to higher dimensionality, and (iv) retrieve only approximate results. Motivated by these shortcomings, we develop algorithms for exact RkNN processing with arbitrary values of k on dynamic, multidimensional datasets. Our methods utilize a conventional data-partitioning index on the dataset and do not require any pre-computation. As a second step, we extend the proposed techniques to continuous RkNN search, which returns the RkNN results for every point on a line segment. We evaluate the effectiveness of our algorithms with extensive experiments using both real and synthetic datasets.