Continuous Monitoring of a Car Parking System

Speaker: Kamiru U Leong Hou

Abstract

Given two datasets A and B, their exclusive closest pairs (ECP) join is a one-to-one assignment of objects from the two datasets, such that (i) the closest pair (a,b) in A X B is in the result and (ii) the remaining pairs are determined by removing objects a,b from A,B respectively, and recursively searching for the next closest pair. An application of exclusive closest pairs is the computation of (car, parking slot) assignments. In this paper, we propose algorithms for the computation of ECP joins in spatial databases and their continuous monitoring. Analytical and experimental results demonstrate that a hybrid method is highly effective in practice.