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.
Lecture Notes in Computer Science: Proceedings of 10th East European Conference, Adbis 2006, Thessaloniki, Greece, September 3-7, 2006, 2006, p. 266-281
Main Research Area:
Lecture Notes in Computer Science
East-European Conference on Advances in Databases and Information Systems, 2006