A content–addressable network for similarity search in metric spaces

  • Falchi F
  • Gennaro C
  • Zezula P
  • 13


    Mendeley users who have this article in their library.
  • 19


    Citations of this article.


In this paper we present a scalable and distributed access structure for similarity search in metric spaces. The approach is based on the Content-addressable Network (CAN) paradigm, which provides a Distributed Hash Table (DHT) abstraction over a Cartesian space. We have extended the CAN structure to support storage and retrieval of generic metric space objects. We use pivots for projecting objects of the metric space in an N-dimensional vector space, and exploit the CAN organization for distributing the objects among the computing nodes of the structure. We obtain a Peer-to-Peer network, called the MCAN, which is able to search metric space objects by means of the similarity range queries. Experiments conducted on our prototype system confirm full scalability of the approach. © Springer-Verlag Berlin Heidelberg 2007.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Fabrizio Falchi

  • Claudio Gennaro

  • Pavel Zezula

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free