A mutual pruning approach for RkNN join processing

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.
  • Vollständige Referenz
  • BibTeX
Emrich, T., Kröger, P., Niedermayer, J., Renz, M. & Züfle, A., (2013). A mutual pruning approach for RkNN join processing. In: Markl, V., Saake, G., Sattler, K.-U., Hackenbroich, G., Mitschang, B., Härder, T. & Köppen, V. (Hrsg.), Datenbanksysteme für Business, Technologie und Web (BTW) 2016. Bonn: Gesellschaft für Informatik e.V.. (S. 21-35).
@inproceedings{mci/Emrich2013,
author = {Emrich, Tobias AND Kröger, Peer AND Niedermayer, Johannes AND Renz, Matthias AND Züfle, Andreas},
title = {A mutual pruning approach for RkNN join processing},
booktitle = {Datenbanksysteme für Business, Technologie und Web (BTW) 2016},
year = {2013},
editor = {Markl, Volker AND Saake, Gunter AND Sattler, Kai-Uwe AND Hackenbroich, Gregor AND Mitschang, Bernhard AND Härder, Theo AND Köppen, Veit} ,
pages = { 21-35 },
publisher = {Gesellschaft für Informatik e.V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
21.pdf599.3Kb PDF Öffnen

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken

Mehr Information

ISBN: 978-3-88579-608-4
ISSN: 1617-5468
Datum: 2013
Sprache: en (en)
Typ: Text/Conference Paper
Sammlungen

Zur Langanzeige