Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
IEEE Spectrum
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Queries with segments in Voronoi diagrams
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
Introduction to Algorithms
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
GIS: A Computing Perspective, 2nd Edition
GIS: A Computing Perspective, 2nd Edition
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
In-Route Nearest Neighbor Queries
Geoinformatica
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
An efficient and scalable approach to CNN queries in a road network
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Adaptive nearest neighbor queries in travel time networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Reverse Nearest Neighbors in Large Graphs
IEEE Transactions on Knowledge and Data Engineering
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Distance join queries on spatial networks
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Monitoring Aggregate k-NN Objects in Road Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Best point detour query in road networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Probabilistic range queries for uncertain trajectories on road networks
Proceedings of the 14th International Conference on Extending Database Technology
Proceedings of the 2011 Workshop on Context-awareness in Retrieval and Recommendation
Finding the most accessible locations: reverse path nearest neighbor query in road networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
In-Route skyline querying for location-based services
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
PNN query processing on compressed trajectories
Geoinformatica
Finding nearest neighbors in road networks: a tree decomposition method
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Secured obfuscated queries in spatial networks
International Journal of Wireless and Mobile Computing
| Hi-index | 0.00 |
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., location-based services, advanced traveler information systems, etc. This paper addresses the problem of finding the in-route nearest neighbor (IRNN) for a query object tuple which consists of a given route with a destination and a current location on it. The IRNN is a facility instance via which the detour from the original route on the way to the destination is smallest. This paper addresses four alternative solution methods. Comparisons among them are presented using an experimental framework. Several experiments using real road map datasets are conducted to examine the behavior of the solutions in terms of three parameters affecting the performance. Our experiments show that the computation costs for all methods except the precomputed zone-based method increase with increases in the road map size and the query route length but decreases with increase in the facility density. The precomputed zone-based method shows the most efficiency when there are no updates on the road map.