Fast and memory-efficient NN search in wireless data broadcast

Sang-Geun Lee, Myong Soo Lee

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

1 Citation (Scopus)

Abstract

It is observed, surprisingly, that existing nearest neighbor search methods may not work well on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search in memory-efficient manner by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach outperforms existing ones considerably in terms of access time without compromising tuning time.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages662-671
Number of pages10
Volume4208 LNCS
Publication statusPublished - 2006 Oct 31
Event2nd International Conference on High Performance Computing and Communications, HPCC 2006 - Munich, Germany
Duration: 2006 Sep 132006 Sep 15

Publication series

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

Other

Other2nd International Conference on High Performance Computing and Communications, HPCC 2006
CountryGermany
CityMunich
Period06/9/1306/9/15

Fingerprint

Nearest Neighbor Search
Broadcast
Data storage equipment
Nearest Neighbor Method
Search Methods
Performance Evaluation
Resolve
Tuning
Demonstrate
Nearest neighbor search

ASJC Scopus subject areas

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

Cite this

Lee, S-G., & Lee, M. S. (2006). Fast and memory-efficient NN search in wireless data broadcast. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4208 LNCS, pp. 662-671). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4208 LNCS).

Fast and memory-efficient NN search in wireless data broadcast. / Lee, Sang-Geun; Lee, Myong Soo.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4208 LNCS 2006. p. 662-671 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4208 LNCS).

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

Lee, S-G & Lee, MS 2006, Fast and memory-efficient NN search in wireless data broadcast. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4208 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4208 LNCS, pp. 662-671, 2nd International Conference on High Performance Computing and Communications, HPCC 2006, Munich, Germany, 06/9/13.
Lee S-G, Lee MS. Fast and memory-efficient NN search in wireless data broadcast. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4208 LNCS. 2006. p. 662-671. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Lee, Sang-Geun ; Lee, Myong Soo. / Fast and memory-efficient NN search in wireless data broadcast. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4208 LNCS 2006. pp. 662-671 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7ae5fa570c0d4b0088964ec2100d68bd,
title = "Fast and memory-efficient NN search in wireless data broadcast",
abstract = "It is observed, surprisingly, that existing nearest neighbor search methods may not work well on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search in memory-efficient manner by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach outperforms existing ones considerably in terms of access time without compromising tuning time.",
author = "Sang-Geun Lee and Lee, {Myong Soo}",
year = "2006",
month = "10",
day = "31",
language = "English",
isbn = "3540393684",
volume = "4208 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "662--671",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Fast and memory-efficient NN search in wireless data broadcast

AU - Lee, Sang-Geun

AU - Lee, Myong Soo

PY - 2006/10/31

Y1 - 2006/10/31

N2 - It is observed, surprisingly, that existing nearest neighbor search methods may not work well on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search in memory-efficient manner by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach outperforms existing ones considerably in terms of access time without compromising tuning time.

AB - It is observed, surprisingly, that existing nearest neighbor search methods may not work well on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search in memory-efficient manner by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach outperforms existing ones considerably in terms of access time without compromising tuning time.

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

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

M3 - Conference contribution

AN - SCOPUS:33750287744

SN - 3540393684

SN - 9783540393689

VL - 4208 LNCS

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

SP - 662

EP - 671

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

ER -