Erratum to "Nearest neighbor search in metric spaces through Content-Addressable Networks" [Information Processing and Management 43 (2007) 665-683]

Falchi F, Gennaro C, Zezula P

Algorithms  Design  Experimentation  Measurement  Performance  Theory  Content-Addressable Network  Metric space  Nearest neighbor search  Peer-to-Peer  Similarity search 

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.

Source: INFORMATION PROCESSING & MANAGEMENT, vol. 44 (issue 1), pp. 411-429