Efficient evaluation of κ-Range Nearest Neighbor queries in road networks

Jie Bao, Chi Yin Chow, Mohamed Mokbel, Wei Shinn Ku

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

Abstract

A κ-Range Nearest Neighbor (or κRNN for short) query in road networks finds the κ nearest neighbors of every point on the road segments within a given query region based on the network distance. The κRNN query is significantly important for location-based applications in many realistic scenarios. For example, (1) the user's location is uncertain, i.e., user's location is modeled by a spatial region, and (2) the user is not willing to reveal her exact location to preserve her privacy, i.e., her location is blurred into a spatial region. However, the existing solutions for κRNN queries simply apply the traditional κ-nearest neighbor query processing algorithm multiple times, which poses a huge redundant searching overhead. To this end, we propose an efficient κRNN query processing algorithm in this paper. Our algorithm (1) employs a shared execution approach to eliminate the redundant searching overhead, and (2) provides a parameter that can be tuned to achieve a tradeoff between the query processing performance and the storage overhead, while guaranteeing the user's exact κ-nearest neighbors are included in the query answers. The experimental results show that our algorithm always outperforms the existing solution in terms of query response time, and the introduced tuning parameter is an effective way to achieve the tradeoff between the query response time and the storage overhead.

Original languageEnglish
Title of host publicationMDM2010 - 11th International Conference on Mobile Data Management
Pages115-124
Number of pages10
DOIs
Publication statusPublished - 9 Aug 2010
Externally publishedYes
Event11th IEEE International Conference on Mobile Data Management, MDM 2010 - Kansas City, MO, United States
Duration: 23 May 201026 May 2010

Other

Other11th IEEE International Conference on Mobile Data Management, MDM 2010
CountryUnited States
CityKansas City, MO
Period23/5/1026/5/10

Fingerprint

Query processing
Tuning

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Bao, J., Chow, C. Y., Mokbel, M., & Ku, W. S. (2010). Efficient evaluation of κ-Range Nearest Neighbor queries in road networks. In MDM2010 - 11th International Conference on Mobile Data Management (pp. 115-124). [5489623] https://doi.org/10.1109/MDM.2010.40

Efficient evaluation of κ-Range Nearest Neighbor queries in road networks. / Bao, Jie; Chow, Chi Yin; Mokbel, Mohamed; Ku, Wei Shinn.

MDM2010 - 11th International Conference on Mobile Data Management. 2010. p. 115-124 5489623.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bao, J, Chow, CY, Mokbel, M & Ku, WS 2010, Efficient evaluation of κ-Range Nearest Neighbor queries in road networks. in MDM2010 - 11th International Conference on Mobile Data Management., 5489623, pp. 115-124, 11th IEEE International Conference on Mobile Data Management, MDM 2010, Kansas City, MO, United States, 23/5/10. https://doi.org/10.1109/MDM.2010.40
Bao J, Chow CY, Mokbel M, Ku WS. Efficient evaluation of κ-Range Nearest Neighbor queries in road networks. In MDM2010 - 11th International Conference on Mobile Data Management. 2010. p. 115-124. 5489623 https://doi.org/10.1109/MDM.2010.40
Bao, Jie ; Chow, Chi Yin ; Mokbel, Mohamed ; Ku, Wei Shinn. / Efficient evaluation of κ-Range Nearest Neighbor queries in road networks. MDM2010 - 11th International Conference on Mobile Data Management. 2010. pp. 115-124
@inproceedings{4eedcac0ec8f41728b4d1bbb5c3aa36a,
title = "Efficient evaluation of κ-Range Nearest Neighbor queries in road networks",
abstract = "A κ-Range Nearest Neighbor (or κRNN for short) query in road networks finds the κ nearest neighbors of every point on the road segments within a given query region based on the network distance. The κRNN query is significantly important for location-based applications in many realistic scenarios. For example, (1) the user's location is uncertain, i.e., user's location is modeled by a spatial region, and (2) the user is not willing to reveal her exact location to preserve her privacy, i.e., her location is blurred into a spatial region. However, the existing solutions for κRNN queries simply apply the traditional κ-nearest neighbor query processing algorithm multiple times, which poses a huge redundant searching overhead. To this end, we propose an efficient κRNN query processing algorithm in this paper. Our algorithm (1) employs a shared execution approach to eliminate the redundant searching overhead, and (2) provides a parameter that can be tuned to achieve a tradeoff between the query processing performance and the storage overhead, while guaranteeing the user's exact κ-nearest neighbors are included in the query answers. The experimental results show that our algorithm always outperforms the existing solution in terms of query response time, and the introduced tuning parameter is an effective way to achieve the tradeoff between the query response time and the storage overhead.",
author = "Jie Bao and Chow, {Chi Yin} and Mohamed Mokbel and Ku, {Wei Shinn}",
year = "2010",
month = "8",
day = "9",
doi = "10.1109/MDM.2010.40",
language = "English",
isbn = "9780769540481",
pages = "115--124",
booktitle = "MDM2010 - 11th International Conference on Mobile Data Management",

}

TY - GEN

T1 - Efficient evaluation of κ-Range Nearest Neighbor queries in road networks

AU - Bao, Jie

AU - Chow, Chi Yin

AU - Mokbel, Mohamed

AU - Ku, Wei Shinn

PY - 2010/8/9

Y1 - 2010/8/9

N2 - A κ-Range Nearest Neighbor (or κRNN for short) query in road networks finds the κ nearest neighbors of every point on the road segments within a given query region based on the network distance. The κRNN query is significantly important for location-based applications in many realistic scenarios. For example, (1) the user's location is uncertain, i.e., user's location is modeled by a spatial region, and (2) the user is not willing to reveal her exact location to preserve her privacy, i.e., her location is blurred into a spatial region. However, the existing solutions for κRNN queries simply apply the traditional κ-nearest neighbor query processing algorithm multiple times, which poses a huge redundant searching overhead. To this end, we propose an efficient κRNN query processing algorithm in this paper. Our algorithm (1) employs a shared execution approach to eliminate the redundant searching overhead, and (2) provides a parameter that can be tuned to achieve a tradeoff between the query processing performance and the storage overhead, while guaranteeing the user's exact κ-nearest neighbors are included in the query answers. The experimental results show that our algorithm always outperforms the existing solution in terms of query response time, and the introduced tuning parameter is an effective way to achieve the tradeoff between the query response time and the storage overhead.

AB - A κ-Range Nearest Neighbor (or κRNN for short) query in road networks finds the κ nearest neighbors of every point on the road segments within a given query region based on the network distance. The κRNN query is significantly important for location-based applications in many realistic scenarios. For example, (1) the user's location is uncertain, i.e., user's location is modeled by a spatial region, and (2) the user is not willing to reveal her exact location to preserve her privacy, i.e., her location is blurred into a spatial region. However, the existing solutions for κRNN queries simply apply the traditional κ-nearest neighbor query processing algorithm multiple times, which poses a huge redundant searching overhead. To this end, we propose an efficient κRNN query processing algorithm in this paper. Our algorithm (1) employs a shared execution approach to eliminate the redundant searching overhead, and (2) provides a parameter that can be tuned to achieve a tradeoff between the query processing performance and the storage overhead, while guaranteeing the user's exact κ-nearest neighbors are included in the query answers. The experimental results show that our algorithm always outperforms the existing solution in terms of query response time, and the introduced tuning parameter is an effective way to achieve the tradeoff between the query response time and the storage overhead.

UR - http://www.scopus.com/inward/record.url?scp=77955215632&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955215632&partnerID=8YFLogxK

U2 - 10.1109/MDM.2010.40

DO - 10.1109/MDM.2010.40

M3 - Conference contribution

SN - 9780769540481

SP - 115

EP - 124

BT - MDM2010 - 11th International Conference on Mobile Data Management

ER -