Nearest Neighbor Queries in Road Networks

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskning

136 Citationer (Scopus)

Abstrakt

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.
OriginalsprogEngelsk
TitelProceedings of the 11th ACM International Symposium on advances in GIS
ForlagAssociation for Computing Machinery
Publikationsdato2003
Sider1-8
StatusUdgivet - 2003
Begivenhed11th International Symposium of ACM GIS - New Orleans, Louisiana, USA
Varighed: 7 nov. 20038 nov. 2003

Konference

Konference11th International Symposium of ACM GIS
LandUSA
ByNew Orleans, Louisiana
Periode07/11/200308/11/2003

Bibliografisk note

ISSN ; -

Fingeraftryk

Dyk ned i forskningsemnerne om 'Nearest Neighbor Queries in Road Networks'. Sammen danner de et unikt fingeraftryk.

Citationsformater