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.

Measurement  Nearest neighbor search  Management Science and Operations Research  Metric space  Theory  Library and Information Sciences  Information Systems  F.2.2 Sorting and searching  Peer-to-Peer  H.3.3 Query formulation  Content-Addressable Network  Similarity search  Design  Algorithms  Computer Science Applications  H.2.4 Query processing  Media Technology  Experimentation  Performance 

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 44 (2008): 411–429. doi:10.1016/j.ipm.2007.03.002

Publisher: Pergamon,, New York , Regno Unito

Metrics