Approximate evaluation of range nearest neighbor queries with quality guarantee

Chi Yin Chow, Mohamed Mokbel, Joe Naps, Suman Nath

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

20 Citations (Scopus)

Abstract

The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a location point, as the query location. Examples of the applications of range NN queries include uncertain locations and privacy-preserving queries. Given a set of objects, the range NN answer is a set of objects that includes the nearest object(s) to every point in a given spatial region. The answer set size would significantly increase as the spatial region gets larger. Unfortunately, mobile users in wireless environments suffer from scarce bandwidth and low-quality communication, transmitting a large answer set from a database server to the user would pose very high response time. To this end, we propose an approximate range NN query processing algorithm to balance a performance tradeoff between query response time and the quality of answers. The distinct features of our algorithm are that (1) it allows the user to specify an approximation tolerance level k, so that we guarantee to provide an answer set such that each object in is one of the k nearest objects to every point in a given query region; and (2) it minimizes the number of objects returned in an answer set, in order to minimize the transmission time of sending the answer set to the user. Extensive experimental results show that our proposed algorithm is scalable and effectively reduces query response time while providing approximate query answers that satisfy the user specified approximation tolerance level.

Original languageEnglish
Title of host publicationAdvances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings
Pages283-301
Number of pages19
DOIs
Publication statusPublished - 2 Nov 2009
Externally publishedYes
Event11th International Symposium on Spatial and Temporal Databases, SSTD 2009 - Aalborg, Denmark
Duration: 8 Jul 200910 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5644 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Symposium on Spatial and Temporal Databases, SSTD 2009
CountryDenmark
CityAalborg
Period8/7/0910/7/09

Fingerprint

Nearest Neighbor
Query
Answer Sets
Evaluation
Range of data
Response time (computer systems)
Location based services
Query processing
Response Time
Servers
Bandwidth
Communication
Tolerance
Minimise
Point Location
Privacy Preserving
Query Processing
Approximation
Large Set
Object

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chow, C. Y., Mokbel, M., Naps, J., & Nath, S. (2009). Approximate evaluation of range nearest neighbor queries with quality guarantee. In Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings (pp. 283-301). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5644 LNCS). https://doi.org/10.1007/978-3-642-02982-0_19

Approximate evaluation of range nearest neighbor queries with quality guarantee. / Chow, Chi Yin; Mokbel, Mohamed; Naps, Joe; Nath, Suman.

Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings. 2009. p. 283-301 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5644 LNCS).

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

Chow, CY, Mokbel, M, Naps, J & Nath, S 2009, Approximate evaluation of range nearest neighbor queries with quality guarantee. in Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5644 LNCS, pp. 283-301, 11th International Symposium on Spatial and Temporal Databases, SSTD 2009, Aalborg, Denmark, 8/7/09. https://doi.org/10.1007/978-3-642-02982-0_19
Chow CY, Mokbel M, Naps J, Nath S. Approximate evaluation of range nearest neighbor queries with quality guarantee. In Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings. 2009. p. 283-301. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02982-0_19
Chow, Chi Yin ; Mokbel, Mohamed ; Naps, Joe ; Nath, Suman. / Approximate evaluation of range nearest neighbor queries with quality guarantee. Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings. 2009. pp. 283-301 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{532e49a69a6c4e64bb121fb2e17b90f6,
title = "Approximate evaluation of range nearest neighbor queries with quality guarantee",
abstract = "The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a location point, as the query location. Examples of the applications of range NN queries include uncertain locations and privacy-preserving queries. Given a set of objects, the range NN answer is a set of objects that includes the nearest object(s) to every point in a given spatial region. The answer set size would significantly increase as the spatial region gets larger. Unfortunately, mobile users in wireless environments suffer from scarce bandwidth and low-quality communication, transmitting a large answer set from a database server to the user would pose very high response time. To this end, we propose an approximate range NN query processing algorithm to balance a performance tradeoff between query response time and the quality of answers. The distinct features of our algorithm are that (1) it allows the user to specify an approximation tolerance level k, so that we guarantee to provide an answer set such that each object in is one of the k nearest objects to every point in a given query region; and (2) it minimizes the number of objects returned in an answer set, in order to minimize the transmission time of sending the answer set to the user. Extensive experimental results show that our proposed algorithm is scalable and effectively reduces query response time while providing approximate query answers that satisfy the user specified approximation tolerance level.",
author = "Chow, {Chi Yin} and Mohamed Mokbel and Joe Naps and Suman Nath",
year = "2009",
month = "11",
day = "2",
doi = "10.1007/978-3-642-02982-0_19",
language = "English",
isbn = "3642029817",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "283--301",
booktitle = "Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings",

}

TY - GEN

T1 - Approximate evaluation of range nearest neighbor queries with quality guarantee

AU - Chow, Chi Yin

AU - Mokbel, Mohamed

AU - Naps, Joe

AU - Nath, Suman

PY - 2009/11/2

Y1 - 2009/11/2

N2 - The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a location point, as the query location. Examples of the applications of range NN queries include uncertain locations and privacy-preserving queries. Given a set of objects, the range NN answer is a set of objects that includes the nearest object(s) to every point in a given spatial region. The answer set size would significantly increase as the spatial region gets larger. Unfortunately, mobile users in wireless environments suffer from scarce bandwidth and low-quality communication, transmitting a large answer set from a database server to the user would pose very high response time. To this end, we propose an approximate range NN query processing algorithm to balance a performance tradeoff between query response time and the quality of answers. The distinct features of our algorithm are that (1) it allows the user to specify an approximation tolerance level k, so that we guarantee to provide an answer set such that each object in is one of the k nearest objects to every point in a given query region; and (2) it minimizes the number of objects returned in an answer set, in order to minimize the transmission time of sending the answer set to the user. Extensive experimental results show that our proposed algorithm is scalable and effectively reduces query response time while providing approximate query answers that satisfy the user specified approximation tolerance level.

AB - The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a location point, as the query location. Examples of the applications of range NN queries include uncertain locations and privacy-preserving queries. Given a set of objects, the range NN answer is a set of objects that includes the nearest object(s) to every point in a given spatial region. The answer set size would significantly increase as the spatial region gets larger. Unfortunately, mobile users in wireless environments suffer from scarce bandwidth and low-quality communication, transmitting a large answer set from a database server to the user would pose very high response time. To this end, we propose an approximate range NN query processing algorithm to balance a performance tradeoff between query response time and the quality of answers. The distinct features of our algorithm are that (1) it allows the user to specify an approximation tolerance level k, so that we guarantee to provide an answer set such that each object in is one of the k nearest objects to every point in a given query region; and (2) it minimizes the number of objects returned in an answer set, in order to minimize the transmission time of sending the answer set to the user. Extensive experimental results show that our proposed algorithm is scalable and effectively reduces query response time while providing approximate query answers that satisfy the user specified approximation tolerance level.

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

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

U2 - 10.1007/978-3-642-02982-0_19

DO - 10.1007/978-3-642-02982-0_19

M3 - Conference contribution

AN - SCOPUS:70350400229

SN - 3642029817

SN - 9783642029813

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 283

EP - 301

BT - Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings

ER -