FINDING NEAREST NEIGHBOR INDEX IN SPATIAL DATABASE

Spatial Indexing based on quadtree coding is important in spatial databases due to its efficient execution of queries involving spatial constraints. In quadtree the computation neighbors of the node is one of the basic problems. In this paper an algorithm for finding the index of nearest neighbors of quadtree node is suggested. Given the index of a node then the algorithm finds the index of its neighbor. Once the indices of the neighbors are obtained then the query execution time is reduced.