Mergedgrid - An Algorithm For Continuous Constrained K Nearest Neighbor Monitoring

A constrained k nearest neighbors (k-NN) query retrieves a set of k nearest objects within a predefined region. Although there are many proposed methods dedicated for continuously monitoring k-NN queries, most of them concerning traditional k-NN queries, only some methods focus on constrained k-NN queries. In this paper, the authors propose MergedGrid, an algorithm to further enhance the performance of GridTree, a novel method for continuously monitoring constrained k-NN queries. Without the need of prior knowledge about the number of objects in the dataset, our algorithm significantly reduces computation time in comparison with the previous algorithm.