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
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 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
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Integrated Query Processing Strategies for Spatial Path Queries
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
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
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Contextual relevance feedback in web information retrieval
IIiX Proceedings of the 1st international conference on Information interaction in context
A peer-to-peer spatial cloaking algorithm for anonymous location-based service
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Distributed computation of the knn graph for large high-dimensional point sets
Journal of Parallel and Distributed Computing
Monitoring Aggregate k-NN Objects in Road Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
The multi-rule partial sequenced route query
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Towards location-based access control in healthcare emergency response
Proceedings of the 2nd SIGSPATIAL ACM GIS 2009 International Workshop on Security and Privacy in GIS and LBS
Continuous evaluation of fastest path queries on road networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
The weighted shortest path search in mobile GIS services
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Real-time monitoring of moving objects using frequently used routes
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Hi-index | 0.00 |
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance information to compute NN queries (e.g., Euclidean distance or spatial network distance). However, the final goal of a user when performing an NN search is often to travel to one of the points of the search result. In this case, finding the nearest neighbors in terms of travel time is more important than the actual distance. In the existing NN algorithms dynamic real-time events (e.g., traffic congestions, detours, etc.) are usually not considered and hence the pre-computed nearest neighbor objects may not accurately reflect the shortest travel time. In this paper we propose a novel travel time network that integrates both spatial networks and real-time traffic event information. Based on this foundation of the travel time network, we develop a local-based greedy nearest neighbor algorithm and a global-based adaptive nearest neighbor algorithm that both utilize real-time traffic information to provide adaptive nearest neighbor search results. We have performed a theoretical analysis and simulations to verify our methods. The results indicate that our algorithms remarkably reduce the travel time compared with previous nearest neighbor solutions.