Group Nearest Neighbor query is a relatively prevalent application in spatial databases and overlay network. Unlike the traditional KNN queries, GNN queries maintain several query points and allow aggregate operations among them. Our paper proposes a novel approach for dealing with difference operation of GNN queries on multiple query points. Difference nearest neighbor (DNN) plays an important role on statistical analysis and engineer computation. Seldom existing approaches consider DNN queries. In our paper, we use the properties of hyperbola to efficiently solve DNN queries. A hyperbola divides the query space into several subspaces. Such properties can help us to prune the search spaces. However, the computation cost using hyperbola is not desirable since it is difficult to estimate spaces using curves. Therefore, we adopt asymptotes of hyperbola to simplify the hyperbola-based pruning strategy to reduce the computation cost and the search space. Our experimental results show that the proposed approaches can efficiently solve DNN queries.
['Bin Wang', 'Xiaochun Yang', 'Guoren Wang', 'Ge Yu']
Efficient difference NN queries for moving objects