Parallel k-Nearest Neighbor Search on Graphics Hardware

Authors:
Weiyi Wang;Liulin Cao
Affiliations:
-;-
Venue:
PAAP '10 Proceedings of the 2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming
Year:
2010

Citing 0
Cited 2

Efficient co-processor utilization in database query processing

Information Systems
Why it is time for a HyPE: a hybrid query processing engine for efficient GPU coprocessing in DBMS

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

k-Nearest Neighbor Search approach has been used extensively in many fields like computer graphics, data mining, pattern recognition, image processing etc. The k-NN Search approach presented in this paper was realized parallel on GPU architecture with KD-Tree data structure. Experiments show that this approach runs tens of times faster than traditional serial search. This work could be used to speed up photon mapping calculations in real time computer graphics.