Logo des Repositoriums
 
Konferenzbeitrag

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

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2013

Autor:innen

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

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).

Beschreibung

Hering, Tim (2013): Parallel execution of kNN-queries on in-memory K-D trees. Datenbanksysteme für Business, Technologie und Web (BTW) 2013 - Workshopband. Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 978-3-88579-610-7. pp. 257-266. Regular Research Papers. Magdeburg. 11.-12. März 2013

Schlagwörter

Zitierform

DOI

Tags