Fast k nearest neighbour search for R-tree family


Kuan, Joseph K. P. and Lewis, Paul H. (1997) Fast k nearest neighbour search for R-tree family. In Proceedings on First International Conf. on Information, Communications, and Signal Processing. Singapore. , 924--928.

Download

[img] Postscript
Download (90Kb)
[img] HTML
Download (0b)

Description/Abstract

A simplified k nearest neighbour (knn) search for the R-tree family is proposed in this paper. This method is modified from the technique developed by Roussopoulos et al. The main approach aims to eliminate redundant searches when the data is highly correlated. We also describe how MINMAXDIST calculations can be avoided using MINDIST as the only distance metric which gives a significant speed up. Our method is compared with Roussopoulos et al.'s knn search on Hilbert R-trees in different dimensions, and shows that an improvement can be achieved on clustered image databases which have large numbers of data objects very close to each other. However, our method only achieved a marginally better performance of pages accessed on randomly distributed databases and random queries far from clustered objects, but has less computation intensity.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 250841
Date Deposited: 16 Sep 1999
Last Modified: 27 Mar 2014 19:52
Further Information:Google Scholar
ISI Citation Count:0
URI: http://eprints.soton.ac.uk/id/eprint/250841

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics