Gesellschaft für Informatik e.V.

Lecture Notes in Informatics


Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband P-216, 257-266 (2013).

Gesellschaft für Informatik, Bonn
2013


Copyright © Gesellschaft für Informatik, Bonn

Contents

Parallel execution of knn-queries on in-memory K-D trees

Tim Hering

Abstract


Parallel algorithms for main memory databases become an increasingly interesting topic as the amount of main memory and the number of CPU cores in computer systems increase. This paper suggests a method for parallelizing the k-d tree and its kNN search algorithm as well as suggesting optimizations. In empirical tests, the resulting modified k-d tree outperforms both the k-d tree and a parallelized sequential search for medium dimensionality data (6-13 dimensions).


Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-610-7


Last changed 12.03.2014 15:16:28