Sciweavers

Share
INFOSCALE
2007
ACM

A distributed incremental nearest neighbor algorithm

9 years 5 months ago
A distributed incremental nearest neighbor algorithm
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audio-visual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, the search exhibits linear scalability with respect to the data set size. In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN ) for finding nearest neighbor in an incremental fashion over data distributed between nodes which are able to perform a local Incremental Nearest Neighbor (local-INN ). We prove that our algorithm is optimal with respect to both number of involved nodes and number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN , was used for conducting an extensive experimental evaluation on a real-life dataset. Categories and Subject Descriptors H.3.3 [Information Search and Retrieval]: Searc...
Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti,
Added 26 Oct 2010
Updated 26 Oct 2010
Type Conference
Year 2007
Where INFOSCALE
Authors Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti, Pavel Zezula
Comments (0)
books