Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that eecient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have be...

In this paper, methods for constructing two dimensional nearest neighbour balanced (NNB) designs are considered. The methods given by Afsarinejad and Seeger (1988) are extended to give a new family of nearest neighbour balanced designs. Both nearest neighbour balanced designs with and without borders are constructed. A method of construction of a class of partial nearest neighbour balanced (PNN...

The (k-)nearest neighbor searching has very high computational costs. The algorithms presented for nearest neighbor search in high dimensional spaces have have suffered from curse of dimensionality, which affects either runtime or storage requirements of the algorithms terribly. Parallelization of nearest neighbor search is a suitable solution for decreasing the workload caused by nearest neigh...