Logo des Repositoriums
 

A mutual pruning approach for RkNN join processing

dc.contributor.authorEmrich, Tobias
dc.contributor.authorKröger, Peer
dc.contributor.authorNiedermayer, Johannes
dc.contributor.authorRenz, Matthias
dc.contributor.authorZüfle, Andreas
dc.contributor.editorMarkl, Volker
dc.contributor.editorSaake, Gunter
dc.contributor.editorSattler, Kai-Uwe
dc.contributor.editorHackenbroich, Gregor
dc.contributor.editorMitschang, Bernhard
dc.contributor.editorHärder, Theo
dc.contributor.editorKöppen, Veit
dc.date.accessioned2018-10-24T09:56:27Z
dc.date.available2018-10-24T09:56:27Z
dc.date.issued2013
dc.description.abstractA 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.en
dc.identifier.isbn978-3-88579-608-4
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/17350
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofDatenbanksysteme für Business, Technologie und Web (BTW) 2016
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-214
dc.titleA mutual pruning approach for RkNN join processingen
dc.typeText/Conference Paper
gi.citation.endPage35
gi.citation.publisherPlaceBonn
gi.citation.startPage21
gi.conference.date13.-15. März 2013
gi.conference.locationMagdeburg
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
21.pdf
Größe:
599.36 KB
Format:
Adobe Portable Document Format