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