Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets

The concept of safe region has been used to reduce the computation and communication cost for the continuous monitoring of k nearest neighbor (k NN) queries. A safe region is an area such that as long as a query remains in it, the set of its k NNs does not change. In this paper, we present an efficient technique to construct the safe region by using cheap RangeNN queries. We also extend our approach for dynamic datasets (the objects may appear or disappear from the dataset). Our proposed algorithm outperforms existing algorithms and scales better with the increase in k .