Multiple k Nearest Neighbor Query Processing in Spatial Network Databases

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

Abstract

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
Pages266-281
ISBN (Print)9783540378990
DOIs
Publication statusPublished - 2006
EventEast-European Conference on Advances in Databases and Information Systems - Thessaloniki, Greece
Duration: 3 Sep 20067 Sep 2006
Conference number: 10

Conference

ConferenceEast-European Conference on Advances in Databases and Information Systems
Number10
CountryGreece
CityThessaloniki
Period03/09/200607/09/2006
SeriesLecture Notes in Computer Science
Number4152
ISSN0302-9743

Fingerprint

Query processing
Data storage equipment
Processing

Cite this

Xuegang, H., Jensen, C. S., & Saltenis, S. (2006). Multiple k Nearest Neighbor Query Processing in Spatial Network Databases. In Advances in Databases and Information Systems: Proceedings of 10th East European Conference, ADBIS 2006, Thessaloniki, Greece, September 3-7, 2006 (pp. 266-281). IEEE Computer Society Press. Lecture Notes in Computer Science, No. 4152 https://doi.org/10.1007/11827252_21
Xuegang, Huang ; Jensen, Christian Søndergaard ; Saltenis, Simonas. / Multiple k Nearest Neighbor Query Processing in Spatial Network Databases. Advances in Databases and Information Systems: Proceedings of 10th East European Conference, ADBIS 2006, Thessaloniki, Greece, September 3-7, 2006. IEEE Computer Society Press, 2006. pp. 266-281 (Lecture Notes in Computer Science; No. 4152).
@inproceedings{ba7bbbc0a08411db8ed6000ea68e967b,
title = "Multiple k Nearest Neighbor Query Processing in Spatial Network Databases",
abstract = "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.",
author = "Huang Xuegang and Jensen, {Christian S{\o}ndergaard} and Simonas Saltenis",
year = "2006",
doi = "10.1007/11827252_21",
language = "English",
isbn = "9783540378990",
series = "Lecture Notes in Computer Science",
publisher = "IEEE Computer Society Press",
number = "4152",
pages = "266--281",
booktitle = "Advances in Databases and Information Systems",
address = "United States",

}

Xuegang, H, Jensen, CS & Saltenis, S 2006, Multiple k Nearest Neighbor Query Processing in Spatial Network Databases. in Advances in Databases and Information Systems: Proceedings of 10th East European Conference, ADBIS 2006, Thessaloniki, Greece, September 3-7, 2006. IEEE Computer Society Press, Lecture Notes in Computer Science, no. 4152, pp. 266-281, East-European Conference on Advances in Databases and Information Systems, Thessaloniki, Greece, 03/09/2006. https://doi.org/10.1007/11827252_21

Multiple k Nearest Neighbor Query Processing in Spatial Network Databases. / Xuegang, Huang; Jensen, Christian Søndergaard; Saltenis, Simonas.

Advances in Databases and Information Systems: Proceedings of 10th East European Conference, ADBIS 2006, Thessaloniki, Greece, September 3-7, 2006. IEEE Computer Society Press, 2006. p. 266-281 (Lecture Notes in Computer Science; No. 4152).

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

TY - GEN

T1 - Multiple k Nearest Neighbor Query Processing in Spatial Network Databases

AU - Xuegang, Huang

AU - Jensen, Christian Søndergaard

AU - Saltenis, Simonas

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

U2 - 10.1007/11827252_21

DO - 10.1007/11827252_21

M3 - Article in proceeding

SN - 9783540378990

T3 - Lecture Notes in Computer Science

SP - 266

EP - 281

BT - Advances in Databases and Information Systems

PB - IEEE Computer Society Press

ER -

Xuegang H, Jensen CS, Saltenis S. Multiple k Nearest Neighbor Query Processing in Spatial Network Databases. In Advances in Databases and Information Systems: Proceedings of 10th East European Conference, ADBIS 2006, Thessaloniki, Greece, September 3-7, 2006. IEEE Computer Society Press. 2006. p. 266-281. (Lecture Notes in Computer Science; No. 4152). https://doi.org/10.1007/11827252_21