Effective low-latency K-nearest neighbor search via wireless data broadcast

Kwang Jin Park; Moon Bae Song; Ki Sik Kong; Sang Won Kang; Chong Sun Hwang; Kwang Sik Chung; Soon Young Jung

doi:10.1007/11733836_67

Effective low-latency K-nearest neighbor search via wireless data broadcast

Kwang Jin Park^*
, Moon Bae Song
, Ki Sik Kong
, Sang Won Kang
, Chong Sun Hwang
, Kwang Sik Chung
, Soon Young Jung

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

To facilitate power saving via wireless data broadcast, index information is typically broadcast along with the data. By first accessing the broadcast index, the mobile client is able to predict the arrival time of the desired data. However, it suffers from the drawback that the client has to wait and tune for an index segment, in order to conserve battery power consumption. Moreover, the average time elapsed between the request for the data and its receipt may increase as a result of these additional messages. In this paper, we present a broadcast-based spatial query processing method designed to support K-NN(K-Nearest Neighbor) queries via wireless data broadcast. With the proposed schemes, the client can perform NN query processing without having to tune into an index segment. Experiments are conducted to evaluate the performance of the proposed methods. The resulting latency and energy consumption are close to the optimum values, as the analysis and simulation results indicate.

Original language	English
Title of host publication	Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings
Publisher	Springer Verlag
Pages	900-909
Number of pages	10
ISBN (Print)	3540333371, 9783540333371
DOIs	https://doi.org/10.1007/11733836_67
Publication status	Published - 2006
Event	11th International Conference on Database Systems for Advanced Applications, DASFAA 2006 - Singapore, Singapore Duration: 2006 Apr 12 → 2006 Apr 15

Publication series

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

Other

Other	11th International Conference on Database Systems for Advanced Applications, DASFAA 2006
Country/Territory	Singapore
City	Singapore
Period	06/4/12 → 06/4/15

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/11733836_67

Cite this

Park, K. J., Song, M. B., Kong, K. S., Kang, S. W., Hwang, C. S., Chung, K. S., & Jung, S. Y. (2006). Effective low-latency K-nearest neighbor search via wireless data broadcast. In Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings (pp. 900-909). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3882 LNCS). Springer Verlag. https://doi.org/10.1007/11733836_67

Effective low-latency K-nearest neighbor search via wireless data broadcast. / Park, Kwang Jin; Song, Moon Bae; Kong, Ki Sik et al.
Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings. Springer Verlag, 2006. p. 900-909 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3882 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Park, KJ, Song, MB, Kong, KS, Kang, SW, Hwang, CS, Chung, KS & Jung, SY 2006, Effective low-latency K-nearest neighbor search via wireless data broadcast. in Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3882 LNCS, Springer Verlag, pp. 900-909, 11th International Conference on Database Systems for Advanced Applications, DASFAA 2006, Singapore, Singapore, 06/4/12. https://doi.org/10.1007/11733836_67

Park KJ, Song MB, Kong KS, Kang SW, Hwang CS, Chung KS et al. Effective low-latency K-nearest neighbor search via wireless data broadcast. In Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings. Springer Verlag. 2006. p. 900-909. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11733836_67

Park, Kwang Jin ; Song, Moon Bae ; Kong, Ki Sik et al. / Effective low-latency K-nearest neighbor search via wireless data broadcast. Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings. Springer Verlag, 2006. pp. 900-909 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6f6e70d49ec040da9e72726ff15e6170,

title = "Effective low-latency K-nearest neighbor search via wireless data broadcast",

abstract = "To facilitate power saving via wireless data broadcast, index information is typically broadcast along with the data. By first accessing the broadcast index, the mobile client is able to predict the arrival time of the desired data. However, it suffers from the drawback that the client has to wait and tune for an index segment, in order to conserve battery power consumption. Moreover, the average time elapsed between the request for the data and its receipt may increase as a result of these additional messages. In this paper, we present a broadcast-based spatial query processing method designed to support K-NN(K-Nearest Neighbor) queries via wireless data broadcast. With the proposed schemes, the client can perform NN query processing without having to tune into an index segment. Experiments are conducted to evaluate the performance of the proposed methods. The resulting latency and energy consumption are close to the optimum values, as the analysis and simulation results indicate.",

author = "Park, \{Kwang Jin\} and Song, \{Moon Bae\} and Kong, \{Ki Sik\} and Kang, \{Sang Won\} and Hwang, \{Chong Sun\} and Chung, \{Kwang Sik\} and Jung, \{Soon Young\}",

year = "2006",

doi = "10.1007/11733836\_67",

language = "English",

isbn = "3540333371",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "900--909",

booktitle = "Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings",

note = "11th International Conference on Database Systems for Advanced Applications, DASFAA 2006 ; Conference date: 12-04-2006 Through 15-04-2006",

}

TY - GEN

T1 - Effective low-latency K-nearest neighbor search via wireless data broadcast

AU - Park, Kwang Jin

AU - Song, Moon Bae

AU - Kong, Ki Sik

AU - Kang, Sang Won

AU - Hwang, Chong Sun

AU - Chung, Kwang Sik

AU - Jung, Soon Young

PY - 2006

Y1 - 2006

N2 - To facilitate power saving via wireless data broadcast, index information is typically broadcast along with the data. By first accessing the broadcast index, the mobile client is able to predict the arrival time of the desired data. However, it suffers from the drawback that the client has to wait and tune for an index segment, in order to conserve battery power consumption. Moreover, the average time elapsed between the request for the data and its receipt may increase as a result of these additional messages. In this paper, we present a broadcast-based spatial query processing method designed to support K-NN(K-Nearest Neighbor) queries via wireless data broadcast. With the proposed schemes, the client can perform NN query processing without having to tune into an index segment. Experiments are conducted to evaluate the performance of the proposed methods. The resulting latency and energy consumption are close to the optimum values, as the analysis and simulation results indicate.

AB - To facilitate power saving via wireless data broadcast, index information is typically broadcast along with the data. By first accessing the broadcast index, the mobile client is able to predict the arrival time of the desired data. However, it suffers from the drawback that the client has to wait and tune for an index segment, in order to conserve battery power consumption. Moreover, the average time elapsed between the request for the data and its receipt may increase as a result of these additional messages. In this paper, we present a broadcast-based spatial query processing method designed to support K-NN(K-Nearest Neighbor) queries via wireless data broadcast. With the proposed schemes, the client can perform NN query processing without having to tune into an index segment. Experiments are conducted to evaluate the performance of the proposed methods. The resulting latency and energy consumption are close to the optimum values, as the analysis and simulation results indicate.

UR - https://www.scopus.com/pages/publications/33745579206

UR - https://www.scopus.com/pages/publications/33745579206#tab=citedBy

U2 - 10.1007/11733836_67

DO - 10.1007/11733836_67

M3 - Conference contribution

AN - SCOPUS:33745579206

SN - 3540333371

SN - 9783540333371

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

SP - 900

EP - 909

BT - Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings

PB - Springer Verlag

T2 - 11th International Conference on Database Systems for Advanced Applications, DASFAA 2006

Y2 - 12 April 2006 through 15 April 2006

ER -

Effective low-latency K-nearest neighbor search via wireless data broadcast

Abstract

Publication series

Other

ASJC Scopus subject areas

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this