Computation and monitoring of exclusive closest pairs

Given two data sets A and B, their exclusive closest pairs (ECP) join is a one-to-one assignment of objects from the two data sets, such that 1 ) the closest pair (a, b) in A × B is in the result and 2) the remaining pairs are determined by removing objects a, b from A, B, respectively, and recursively searching for the next closest pair. A real application of ECP is the computation of (car and parking slot) assignments. This paper introduces the problem and proposes several solutions that solve it in main-memory, exploiting space partitioning. In addition, we define a dynamic version of the problem, where the objective is to continuously monitor the ECP join solution, in an environment where the joined data sets change positions and content. Finally, we study an extended form of the query, where objects in one of the two joined sets (e.g., parking slots) have a capacity constraint, allowing them to match with multiple objects from the other set (e.g., cars). We show how our techniques can be extended for this variant and compare them with a previous solution to this problem. Experimental results on a system prototype demonstrate the efficiency and applicability of the proposed algorithms.