($k+m$ ) NN Queries

 

At any time a $k$ NN query can be updated by the user to continuously monitor ($k+m$ ) nearest neighbors instead of $k$ nearest neighbors of $q$ where $m>-k$ . The queries that support such updates on the number of nearest neighbors are called ($k+m$ )NNs queries. It gives flexibility to the user that he can change, at any time, the number of nearest neighbors he wants to continuously monitor. Below we show that by using our approach such kind of queries can be efficiently answered without visiting any unnecessary cell.