Nearest neighbor queries in road networks

With wireless communications and geo-positioning being widely available, it becomes possible to offer new e-services that provide mobile users with information about other mobile objects. This paper concerns active, ordered k-nearest neighbor queries for query and data objects that are moving in road networks. Such queries may be of use in many services. Specifically, we present an easily implementable data model that serves well as a foundation for such queries. We also present the design of a prototype system that implements the queries based on the data model. The algorithm used for the nearest neighbor search in the prototype is presented in detail. In addition, the paper reports on results from experiments with the prototype system. Categories and Subject Descriptors H.2.2 [Database Management]: Physical Design--access methods; H.2.8 [Database Management]: Database Applications--spatial databases and GIS General Terms Algorithms Keywords Location-based services, road networks, ne...

• Type: Conference
• Year: 2003
• Where: GIS
• Authors: Christian S. Jensen, Jan Kolárvr, Torben Bach Pedersen, Igor Timko
• Keywords: Database, GIS 2003, K-nearest Neighbor Queries, Nearest Neighbor Search, Such Queries