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
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Effective nearest neighbor indexing with the euclidean metric
Proceedings of the tenth international conference on Information and knowledge management
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space
IEEE Transactions on Knowledge and Data Engineering
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
What Is the Nearest Neighbor in High Dimensional Spaces?
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Contorting high dimensional data for efficient main memory KNN processing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
PRIVE: anonymous location-based queries in distributed mobile systems
Proceedings of the 16th international conference on World Wide Web
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
IEEE Transactions on Knowledge and Data Engineering
Private queries in location based services: anonymizers are not necessary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Protecting location privacy against location-dependent attack in mobile services
Proceedings of the 17th ACM conference on Information and knowledge management
Dual-heap kNN: k-nearest neighbor search for spatial data retrieval in embedded DBMS
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Paginação de resultados em consultas por abrangência
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
Continuous visible nearest neighbor queries
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
Privacy in location-based services: a system architecture perspective
SIGSPATIAL Special
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Casper*: Query processing for location services without compromising privacy
ACM Transactions on Database Systems (TODS)
A reciprocal framework for spatial K-anonymity
Information Systems
MOBIHIDE: a mobilea peer-to-peer system for anonymous location-based queries
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
A motion-aware approach for efficient evaluation of continuous queries on 3D object databases
The VLDB Journal — The International Journal on Very Large Data Bases
Nearest neighbor search with strong location privacy
Proceedings of the VLDB Endowment
"Don't trust anyone": Privacy protection for location-based services
Pervasive and Mobile Computing
Design and analysis of a ranking approach to private location-based services
ACM Transactions on Database Systems (TODS)
Information Sciences: an International Journal
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Trajectory privacy in location-based services and data publication
ACM SIGKDD Explorations Newsletter
An open design privacy-enhancing platform supporting location-based applications
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Journal of Systems Architecture: the EUROMICRO Journal
A framework for efficient spatial web object retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
Countering overlapping rectangle privacy attack for moving kNN queries
Information Systems
Anonymous spatial query on non-uniform data
Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services
Proceedings of the Third ACM SIGSPATIAL International Workshop on Querying and Mining Uncertain Spatio-Temporal Data
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Parameter-free and domain-independent similarity search with diversity
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Preserving location privacy without exact locations in mobile services
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
A range nearest-neighbor (RNN) query retrieves the nearest neighbor (NN) for every point in a range. It is a natural generalization of point and continuous nearest-neighbor queries and has many applications. In this paper, we consider the ranges as (hyper)rectangles and propose efficient in-memory processing and secondary memory pruning techniques for RNN queries in both 2D and high-dimensional spaces. These techniques are generalized for kRNN queries, which return the k nearest neighbors for every point in the range. In addition, we devise an auxiliary solution-based index EXO-tree to speed up any type of NN query. EXO-tree is orthogonal to any existing NN processing algorithm and, thus, can be transparently integrated. An extensive empirical study was conducted to evaluate the CPU and I/O performance of these techniques, and the study showed that they are efficient and robust under various data sets, query ranges, numbers of nearest neighbors, dimensions, and cache sizes.