A Nearest Neighbor Data Structure for Graphics Hardware

Provided by: Max Planck Institute for Biological Cybernetics
Topic: Hardware
Format: PDF
Nearest neighbor search is a core computational task in database systems and throughout data analysis. It is also a major computational bottleneck, and hence an enormous body of research has been devoted to data structures and algorithms for accelerating the task. Recent advances in graphics hardware provide tantalizing speedups on a variety of tasks and suggest an alternate approach to the problem: simply run brute force search on a massively parallel system. In this paper, the authors marry the approaches with a novel data structure that can effectively make use of parallel systems such as graphics cards.

Find By Topic