Exploit every bit: Effective caching for high-dimensional nearest neighbor search (Extended abstract)

Bo Tang; Man Lung Yiu; Kien A. Hua

doi:10.1109/ICDE.2017.29

Exploit every bit: Effective caching for high-dimensional nearest neighbor search (Extended abstract)

Bo Tang, Man Lung Yiu, Kien A. Hua

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

2 Citations (Scopus)

Original language	English
Title of host publication	Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017
Publisher	IEEE Computer Society
Pages	45-46
Number of pages	2
ISBN (Electronic)	9781509065431
DOIs	https://doi.org/10.1109/ICDE.2017.29
Publication status	Published - 16 May 2017
Event	33rd IEEE International Conference on Data Engineering, ICDE 2017 - San Diego, United States Duration: 19 Apr 2017 → 22 Apr 2017

Conference

Conference	33rd IEEE International Conference on Data Engineering, ICDE 2017
Country/Territory	United States
City	San Diego
Period	19/04/17 → 22/04/17

ASJC Scopus subject areas

Software
Signal Processing
Information Systems

More information

10.1109/ICDE.2017.29

Cite this

@inproceedings{4924ef2dc6334f13a8f065e3c57e095c,

title = "Exploit every bit: Effective caching for high-dimensional nearest neighbor search (Extended abstract)",

author = "Bo Tang and Yiu, {Man Lung} and Hua, {Kien A.}",

year = "2017",

month = may,

day = "16",

doi = "10.1109/ICDE.2017.29",

language = "English",

pages = "45--46",

booktitle = "Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017",

publisher = "IEEE Computer Society",

address = "United States",

note = "33rd IEEE International Conference on Data Engineering, ICDE 2017 ; Conference date: 19-04-2017 Through 22-04-2017",

}

Tang, B, Yiu, ML & Hua, KA 2017, Exploit every bit: Effective caching for high-dimensional nearest neighbor search (Extended abstract). in Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017., 7929925, IEEE Computer Society, pp. 45-46, 33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, United States, 19/04/17. https://doi.org/10.1109/ICDE.2017.29

Exploit every bit: Effective caching for high-dimensional nearest neighbor search (Extended abstract). / Tang, Bo; Yiu, Man Lung; Hua, Kien A.
Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017. IEEE Computer Society, 2017. p. 45-46 7929925.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Exploit every bit: Effective caching for high-dimensional nearest neighbor search (Extended abstract)

AU - Tang, Bo

AU - Yiu, Man Lung

AU - Hua, Kien A.

PY - 2017/5/16

Y1 - 2017/5/16

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

U2 - 10.1109/ICDE.2017.29

DO - 10.1109/ICDE.2017.29

M3 - Conference article published in proceeding or book

SP - 45

EP - 46

BT - Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017

PB - IEEE Computer Society

T2 - 33rd IEEE International Conference on Data Engineering, ICDE 2017

Y2 - 19 April 2017 through 22 April 2017

ER -

Exploit every bit: Effective caching for high-dimensional nearest neighbor search (Extended abstract)

Conference

ASJC Scopus subject areas

More information

Other files and links

Cite this