Pre-computed Region Guardian Sets Based Reverse kNN QueriesReport as inadecuate




Pre-computed Region Guardian Sets Based Reverse kNN Queries - Download this document for free, or read online. Document in PDF available to download.

Data Science and Engineering

, Volume 1, Issue 4, pp 242–251

First Online: 26 January 2017Received: 30 June 2016Accepted: 16 December 2016

Abstract

Given a set of objects and a query q, a point p is q’s Reverse k Nearest Neighbour RkNN if q is one of p’s k-closest objects. RkNN queries have received significant research attention in the past few years. However, we realize that the state-of-the-art algorithm, SLICE, accesses many objects that do not contribute to its RkNN results when running the filtering phase, which deteriorates the query performance. In this paper, we propose a novel RkNN algorithm with pre-computation by partitioning the data space into disjoint rectangular regions and constructing the guardian set for each region R. We guarantee that, for each q that lies in R, its RkNN results are only affected by the objects in R’s guardian set. The advantage of this approach is that the results of a query \q\in R\ can be computed by using SLICE on only the objects in its guardian set instead of using the whole dataset. Besides, we raise two new useful variants of RkNN and propose algorithms. Our comprehensive experimental study on synthetic and real the proposed approaches are the most efficient algorithms for RkNN and its variants.

KeywordsRkNN Variants Pre-computation Guardian Set SLICE  Download fulltext PDF



Author: Wei Song - Jianbin Qin - Muhammad Aamir Cheema - Wei Wang

Source: https://link.springer.com/







Related documents