Nearest Neighbor Queries in Road Networks

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearch

154 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the 11th ACM International Symposium on advances in GIS
PublisherAssociation for Computing Machinery
Publication date2003
Pages1-8
Publication statusPublished - 2003
Event11th International Symposium of ACM GIS - New Orleans, Louisiana, United States
Duration: 7 Nov 20038 Nov 2003

Conference

Conference11th International Symposium of ACM GIS
Country/TerritoryUnited States
CityNew Orleans, Louisiana
Period07/11/200308/11/2003

Keywords

  • Road network
  • Location-based services
  • Query processing
  • Nearest neighbors

Fingerprint

Dive into the research topics of 'Nearest Neighbor Queries in Road Networks'. Together they form a unique fingerprint.

Cite this