PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Falchi F., Gennaro C., Zezula P. Nearest neighbor search in metric spaces through content-addressable networks. In: Information Processing and Management, vol. 44 (1) pp. 411 - 429. Elsevier, 2008.
 
 
Abstract
(English)
Most of the peer-to-peer search techniques proposed in the recent years have focused on the single-key retrieval. However, similarity search in metric spaces represents an important paradigm for content-based retrieval in many applications. In this paper we introduce an extension of the well-known Content-Addressable Network paradigm to support storage and retrieval of more generic metric space objects. In particular we address the problem of executing the nearest neighbors queries, and propose three different algorithms of query propagation. An extensive experimental study on real-life data sets explores the performance characteristics of the proposed algorithms by showing their advantages and disadvantages.
URL: http://scienceserver.cilea.it/cgi-bin/sciserv.pl?collection=journals&journal=03064573
DOI: 10.1016/j.ipm.2007.03.002
Subject Algorithms
Design
Experimentation
Measurement
Performance
Theory
Content-Addressable Network
Metric space
Nearest neighbor search
Peer-to-Peer
Similarity search
H.2.4 Query processing
F.2.2 Sorting and searching
H.3.3 Query formulation


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional