All of DSpace

Browsing by Subject "Group nearest neighbor queries"

Now showing items 1-4 of 4

    • The K group nearest-neighbor query on non-indexed RAM-resident data 

      Roumelis G., Vassilakopoulos M., Corral A., Manolopoulos Y. (2016)
      Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query ...

    • MapReduce algorithms for the k group nearest-neighbor query 

      Moutafis P., Vassilakopoulos M., García-García F., Corral A., Mavrommatis G., Iribarne L. (2019)
      Given two datasets of points (called Query and Training), the Group (K) Nearest Neighbor (GNN) query retrieves (K) points of the Training dataset with the smallest sum of distances to every point of the Query one. This ...

    • 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 ...