Thesis Organization

The rest of the thesis is organized as follows.

• A detailed survey of previous work on nearest neighbor queries and its variants has been presented in Chapter .
• In Chapter , we present our grid access methods named CircularTrip and ArcTrip.
• A CircularTrip based algorithm for continuous monitoring of $k$ NN queries is presented in Chapter . Comparison with previous best known approach (CPM) is also presented in Chapter .
• In Chapter , we briefly describe the techniques to continuously monitor other variants of $k$ NN queries by using CircularTrip and ArcTrip.
• Chapter  concludes our research presented in this thesis.