Computational geometry: an introduction
Computational geometry: an introduction
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Closest pair queries in spatial databases
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
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
ACM Transactions on Mathematical Software (TOMS)
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
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
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Algorithms for processing K-closest-pair queries in spatial databases
Data & Knowledge Engineering
All-Nearest-Neighbors Queries in Spatial Databases
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Reverse nearest neighbor aggregates over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
The multi-rule partial sequenced route query
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Route Search over Probabilistic Geospatial Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Multi-type nearest neighbor queries in road networks with time window constraints
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
On multi-type reverse nearest neighbor search
Data & Knowledge Engineering
| Hi-index | 0.00 |
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of each feature is visited during the tour. For example, a tourist may be interested in finding the shortest tour which starts at a hotel and passes through a post office, a gas station, and a grocery store. The MTNN query problem is different from the traditional nearest neighbor query problem in that there are many objects for each feature type and the shortest tour should pass through only one object from each feature type. In this paper, we propose an R-tree based algorithm that exploits a page-level upper bound for efficient computation in clustered data sets and finds optimal query results. We compare our method with a recently proposed method, RLORD, which was developed to solve the optimal sequenced route (OSR) query. In our view, OSR represents a spatially constrained version of MTNN. Experimental results are provided to show the strength of our algorithm and design decisions related to performance tuning.