Processing in-route nearest neighbor queries: a comparison of alternative approaches
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
In-Route Nearest Neighbor Queries
Geoinformatica
Exploiting a page-level upper bound for multi-type nearest neighbor queries
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Efficient index-based KNN join processing for high-dimensional data
Information and Software Technology
Multi-point queries in large spatial databases
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
ACM Transactions on Database Systems (TODS)
Challenges and techniques for effective and efficient similarity search in large video databases
Proceedings of the VLDB Endowment
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
Design and evaluation of trajectory join algorithms
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Continuous monitoring of exclusive closest pairs
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Optimizing all-nearest-neighbor queries with trigonometric pruning
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
All-nearest-neighbors finding based on the Hilbert curve
Expert Systems with Applications: An International Journal
Finding the sites with best accessibilities to amenities
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Closest pair queries with spatial constraints
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Reverse-k-Nearest-Neighbor join processing
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Given two sets A and B of multidimensional objects, theall-nearest-neighbors (ANN) query retrieves for eachobject in A its nearest neighbor in B. Although thisoperation is common in several applications, it has notreceived much attention in the database literature. Inthis paper we study alternative methods for processingANN queries depending on whether A and B areindexed. Our algorithms are evaluated throughextensive experimentation using synthetic and realdatasets. The performance studies show that they arean order of magnitude faster than a previous approachbased on closest-pairs query processing.