Fast and memory-efficient NN search in wireless data broadcast

Sang-Geun Lee; Myong Soo Lee

doi:10.1007/11847366_68

Fast and memory-efficient NN search in wireless data broadcast

Sang-Geun Lee, Myong Soo Lee

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	High Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings
Publisher	Springer Verlag
Pages	662-671
Number of pages	10
ISBN (Print)	3540393684, 9783540393689
DOIs	https://doi.org/10.1007/11847366_68
Publication status	Published - 2006
Event	2nd International Conference on High Performance Computing and Communications, HPCC 2006 - Munich, Germany Duration: 2006 Sept 13 → 2006 Sept 15

Publication series

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

Other

Other	2nd International Conference on High Performance Computing and Communications, HPCC 2006
Country/Territory	Germany
City	Munich
Period	06/9/13 → 06/9/15

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11847366_68

Cite this

Lee, S.-G., & Lee, M. S. (2006). Fast and memory-efficient NN search in wireless data broadcast. In High Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings (pp. 662-671). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4208 LNCS). Springer Verlag. https://doi.org/10.1007/11847366_68

Fast and memory-efficient NN search in wireless data broadcast. / Lee, Sang-Geun; Lee, Myong Soo.
High Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings. Springer Verlag, 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 proceeding › Conference contribution

Lee, S-G & Lee, MS 2006, Fast and memory-efficient NN search in wireless data broadcast. in High Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4208 LNCS, Springer Verlag, pp. 662-671, 2nd International Conference on High Performance Computing and Communications, HPCC 2006, Munich, Germany, 06/9/13. https://doi.org/10.1007/11847366_68

Lee SG, Lee MS. Fast and memory-efficient NN search in wireless data broadcast. In High Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings. Springer Verlag. 2006. p. 662-671. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11847366_68

Lee, Sang-Geun ; Lee, Myong Soo. / Fast and memory-efficient NN search in wireless data broadcast. High Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings. Springer Verlag, 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",

doi = "10.1007/11847366_68",

language = "English",

isbn = "3540393684",

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

publisher = "Springer Verlag",

pages = "662--671",

booktitle = "High Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings",

note = "2nd International Conference on High Performance Computing and Communications, HPCC 2006 ; Conference date: 13-09-2006 Through 15-09-2006",

}

TY - GEN

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

AU - Lee, Sang-Geun

AU - Lee, Myong Soo

PY - 2006

Y1 - 2006

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

U2 - 10.1007/11847366_68

DO - 10.1007/11847366_68

M3 - Conference contribution

AN - SCOPUS:33750287744

SN - 3540393684

SN - 9783540393689

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

SP - 662

EP - 671

BT - High Performance Computing and Communications - Second International Conference, HPCC 2006, Proceedings

PB - Springer Verlag

T2 - 2nd International Conference on High Performance Computing and Communications, HPCC 2006

Y2 - 13 September 2006 through 15 September 2006

ER -

Fast and memory-efficient NN search in wireless data broadcast

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this