A common and important query type in spatial networks is to find the Group KNearest Neighbors “GKNN” of a given query objects set. Given two sets of points P and Q, the result of group Knearest neighbors (GKNN) query is the point(s) of P with the smallest sum of distances to all points in Q. Due to the difficulties and the expense of the required calculations to answer such a query, almost all ...