Multiple k Nearest Neighbor Query Processing in Spatial Network Databases

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

12 Citationer (Scopus)

Abstrakt

This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries for points of interest that are accessible via the road network. Given multiple k nearest neighbor queries, the paper proposes progressive techniques that selectively cache query results in main memory and subsequently reuse these for query processing. The paper initially proposes techniques for the case where an upper bound on k is known a priori and then extends the techniques to the case where this is not so. Based on empirical studies with real-world data, the paper offers insight into the circumstances under which the different proposed techniques can be used with advantage for multiple k nearest neighbor query processing.
OriginalsprogEngelsk
TitelAdvances in Databases and Information Systems : Proceedings of 10th East European Conference, ADBIS 2006, Thessaloniki, Greece, September 3-7, 2006
Antal sider16
ForlagIEEE Computer Society Press
Publikationsdato2006
Sider266-281
ISBN (Trykt)9783540378990
DOI
StatusUdgivet - 2006
BegivenhedEast-European Conference on Advances in Databases and Information Systems - Thessaloniki, Grækenland
Varighed: 3 sep. 20067 sep. 2006
Konferencens nummer: 10

Konference

KonferenceEast-European Conference on Advances in Databases and Information Systems
Nummer10
LandGrækenland
ByThessaloniki
Periode03/09/200607/09/2006
NavnLecture Notes in Computer Science
Nummer4152
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'Multiple <em>k</em> Nearest Neighbor Query Processing in Spatial Network Databases'. Sammen danner de et unikt fingeraftryk.

Citationsformater