Record number :
Title of article :
Nearest neighbor search in metric spaces through Content-Addressable Networks
Author/Authors :
Fabrizio Falchi، نويسنده , , Claudio Gennaro، نويسنده , , Pavel Zezula، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2008
Pages :
From page :
To page :
Abstract :
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 execution. An extensive experimental study on real-life data sets explores the performance characteristics of the proposed algorithms by showing their advantages and disadvantages.
Keywords :
Metric space , Nearest neighbor search , Content-Addressable Network , Similarity search , PEER-TO-PEER
Journal title :
Information Processing and Management
Link To Document :