Πλοήγηση ανά Θέμα "K-closest pairs"
Αποτελέσματα 1-3 από 3
-
Enhancing the SliceNBound Algorithm for the Closest-Pairs Query with Binary Space Partitioning
(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 ... -
Improving Distance-Join Query processing with Voronoi-Diagram based partitioning in SpatialHadoop
(2020)SpatialHadoop is an extended MapReduce framework supporting global indexing techniques that partition spatial datasets across several machines and improve spatial query processing performance compared to traditional Hadoop ... -
Voronoi-diagram based partitioning for distance join query processing in spatialhadoop
(2018)SpatialHadoop is an extended MapReduce framework supporting global indexing techniques that partition spatial data across several machines and improve query processing performance compared to traditional Hadoop systems. ...