Reverse Nearest Neighbourhood Search in Spatial Databases

In this thesis, we introduce a new retrieval of a group of points that are geographically close to each other, instead of on individual and widely dispersed points. We present efficient algorithms to retrieve a group of points, named Neighbourhood. A neighbourhood is a collection of m-chained points within the maximum distance (d) between a pair of points. We are the first to introduce the definition of the neighbourhood to compute Reverse Nearest Neighbourhood (RNNH) Query. We investigated on different environments, Euclidean, road networks, static and moving queries.