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

KwangJin Park, MoonBae Song, Ki Sik Kong, Sang Won Kang, Chong Sun Hwang, Kwang Sik Chung, Soon Young Jung

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages900-909
Number of pages10
Volume3882 LNCS
Publication statusPublished - 2006 Jul 7
Event11th International Conference on Database Systems for Advanced Applications, DASFAA 2006 - Singapore, Singapore
Duration: 2006 Apr 122006 Apr 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3882 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other11th International Conference on Database Systems for Advanced Applications, DASFAA 2006
CountrySingapore
CitySingapore
Period06/4/1206/4/15

Fingerprint

Nearest Neighbor Search
Query processing
Broadcast
Latency
Query Processing
Electric power utilization
Energy utilization
Power Saving
Time of Arrival
Conserve
Time-average
Battery
Experiments
Power Consumption
Energy Consumption
Nearest Neighbor
Nearest neighbor search
Power (Psychology)
Query
Predict

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Park, K., Song, M., 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3882 LNCS, pp. 900-909). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3882 LNCS).

Effective low-latency K-nearest neighbor search via wireless data broadcast. / Park, KwangJin; Song, MoonBae; Kong, Ki Sik; Kang, Sang Won; Hwang, Chong Sun; Chung, Kwang Sik; Jung, Soon Young.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3882 LNCS 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 proceedingConference contribution

Park, K, Song, M, Kong, KS, Kang, SW, Hwang, CS, Chung, KS & Jung, SY 2006, Effective low-latency K-nearest neighbor search via wireless data broadcast. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3882 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3882 LNCS, pp. 900-909, 11th International Conference on Database Systems for Advanced Applications, DASFAA 2006, Singapore, Singapore, 06/4/12.
Park K, Song M, Kong KS, Kang SW, Hwang CS, Chung KS et al. Effective low-latency K-nearest neighbor search via wireless data broadcast. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3882 LNCS. 2006. p. 900-909. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Park, KwangJin ; Song, MoonBae ; Kong, Ki Sik ; Kang, Sang Won ; Hwang, Chong Sun ; Chung, Kwang Sik ; Jung, Soon Young. / Effective low-latency K-nearest neighbor search via wireless data broadcast. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3882 LNCS 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 = "KwangJin Park and MoonBae Song and Kong, {Ki Sik} and Kang, {Sang Won} and Hwang, {Chong Sun} and Chung, {Kwang Sik} and Jung, {Soon Young}",
year = "2006",
month = "7",
day = "7",
language = "English",
isbn = "3540333371",
volume = "3882 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "900--909",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Park, KwangJin

AU - Song, MoonBae

AU - Kong, Ki Sik

AU - Kang, Sang Won

AU - Hwang, Chong Sun

AU - Chung, Kwang Sik

AU - Jung, Soon Young

PY - 2006/7/7

Y1 - 2006/7/7

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 - http://www.scopus.com/inward/record.url?scp=33745579206&partnerID=8YFLogxK

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

M3 - Conference contribution

AN - SCOPUS:33745579206

SN - 3540333371

SN - 9783540333371

VL - 3882 LNCS

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

SP - 900

EP - 909

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

ER -