Multiple k Nearest Neighbor Query Processing in Spatial Network Databases

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

17 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationAdvances in Databases and Information Systems : Proceedings of 10th East European Conference, ADBIS 2006, Thessaloniki, Greece, September 3-7, 2006
Number of pages16
PublisherIEEE Computer Society Press
Publication date2006
ISBN (Print)9783540378990
Publication statusPublished - 2006
EventEast-European Conference on Advances in Databases and Information Systems - Thessaloniki, Greece
Duration: 3 Sept 20067 Sept 2006
Conference number: 10


ConferenceEast-European Conference on Advances in Databases and Information Systems
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Multiple k Nearest Neighbor Query Processing in Spatial Network Databases'. Together they form a unique fingerprint.

Cite this