Publication details
Nearest neighbor search in metric spaces through Content
-Addressable Networks
| Basic information | |
|---|---|
| Original title: | Nearest neighbor search in metric spaces through Content-Addressable Networks |
| Authors: | Fabrizio Falchi, Claudio Gennaro, Pavel Zezula |
| Further information | |
|---|---|
| Citation: | FALCHI, Fabrizio - GENNARO, Claudio - ZEZULA, Pavel. Nearest neighbor search in metric spaces through Content-Addressable Networks. Information Processing and Management, ELSEVIER, USA. ISSN 0306-4573, 2007, vol. 43/2007, no. 1, pp. 665-683. |
| Original language: | English |
| Field: | Informatika |
| WWW: |  http://www.sciencedirect.com/science/journal/03064573 |
| Type: | Article in Periodical |
| Keywords: | similarity search; scalability; peer-to-peer architecture; nearest neigbor; content addressing |
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.
Related projects:
