Group Enclosing Queries

Feifei Li, Bin Yao, Piyush Kumar
2011 IEEE Transactions on Knowledge and Data Engineering  
Given a set of points P and a query set Q, a group enclosing query (GEQ) fetches the point p * ∈ P such that the maximum distance of p * to all points in Q is minimized. This problem is equivalent to the Min-Max case (minimizing the maximum distance) of aggregate nearest neighbor queries for spatial databases [27] . This work first designs a new exact solution by exploring new geometric insights, such as the minimum enclosing ball, the convex hull and the furthest voronoi diagram of the query
more » ... oup. To further reduce the query cost, especially when the dimensionality increases, we turn to approximation algorithms. Our main approximation algorithm has a worst case √ 2-approximation ratio if one can find the exact nearest neighbor of a point. In practice, its approximation ratio never exceeds 1.05 for a large number of data sets up to six dimension. We also discuss how to extend it to higher dimensions (up to 74 in our experiment) and show that it still maintains a very good approximation quality (still close to 1) and low query cost. In fixed dimensions, we extend the √ 2-approximation algorithm to get a (1 + ǫ)-approximate solution for the GEQ problem. Both approximation algorithms have O(log N + M ) query cost in any fixed dimension, where N and M are the sizes of the data set P and query group Q. Extensive experiments on both synthetic and real data sets, up to 10 million points and 74 dimensions, confirm the efficiency, effectiveness and scalability of the proposed algorithms, especially their significant improvement over the state-of-the-art method. Index Terms-Aggregate nearest neighbor, approximate nearest neighbor, minmax nearest neighbor, nearest neighbor 3
doi:10.1109/tkde.2010.181 fatcat:fo5cfv3i4ndqfmklhlyfxcpm4u