Logo des Repositoriums
 
Konferenzbeitrag

A mutual pruning approach for RkNN join processing

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2013

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

A reverse k-nearest neighbour (RkNN) query determines the objects from a database that have the query as one of their k-nearest neighbors. Processing such a query has received plenty of attention in research. However, the effect of running multiple RkNN queries at once (join) or within a short time interval (bulk/group query) has, to the best of our knowledge, not been addressed so far. In this paper, we analyze RkNN joins and discuss possible solutions for solving this problem. During our performance analysis we provide evaluation results showing the IO and CPU performance of the compared algorithms for a variety of different setups.

Beschreibung

Emrich, Tobias; Kröger, Peer; Niedermayer, Johannes; Renz, Matthias; Züfle, Andreas (2013): A mutual pruning approach for RkNN join processing. Datenbanksysteme für Business, Technologie und Web (BTW) 2016. Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 978-3-88579-608-4. pp. 21-35. Regular Research Papers. Magdeburg. 13.-15. März 2013

Schlagwörter

Zitierform

DOI

Tags