Όλο το DSpace

Πλοήγηση ανά Θέμα "Closest pair queries"

Αποτελέσματα 1-2 από 2

    • Enhancing spatialhadoop with closest pair queries 

      García-García F., Corral A., Iribarne L., Vassilakopoulos M., Manolopoulos Y. (2016)
      Given two datasets P and Q, the K Closest Pair Query (KCPQ) finds the K closest pairs of objects from P×Q. It is an operation widely adopted by many spatial and GIS applications. As a combination of the K Nearest Neighbor ...

    • Enhancing the SliceNBound Algorithm for the Closest-Pairs Query with Binary Space Partitioning 

      Mavrommatis G., Moutafis P., Corral A. (2021)
      Given two datasets P and Q, the (K) Closest-Pairs Query, KCPQ, finds the (K) pairs of objects between the datasets with the least distance. In a previous work, we presented SliceNBound, a fast distributed algorithm for the ...