In Reverse Nearest Neighbour (RNN) Query, every single object in the space has a certain region where all objects inside this region will think of the query object as their nearest neighbour. Other objects that are outside the region will not consider the query object as their nearest neighbour. In many cases, we might encounter a situation where we want to find this kind of region for several objects altogether, instead of a single object.
Current RNN region approach cannot be used for this problem. Therefore we propose Group Reverse kNN as a solution, which we will find a specific region based on multiple query objects. So any objects located inside this region will always consider all of the query objects as the nearest compare to the non-query objects. Our experiments demonstrate the performance efficiency of the proposed Group Reverse kNN algorithm.