• Plane-sweep algorithms for the K Group Nearest-Neighbor Query 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A.; Manolopoulos, Y. (2015)
      One of the most representative and studied queries in Spatial Databases is the (K) Nearest-Neighbor (NNQ), that discovers the (K) nearest neighbor(s) to a query point. An extension that is important for practical applications ...
    • Prepartitioning in MapReduce Processing of Group Nearest-Neighbor Query 

      Moutafis P., Mavrommatis G., Velentzas P. (2020)
      Given two datasets of points (called Query and Training), the Group (K) Nearest-Neighbor (GKNN) query retrieves (K) points of the Training with the smallest sum of distances to every point of the Query. This spatial query ...