A Content–Addressable Network for Similarity Search in Metric Spaces

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4125)


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.


Range Query Access Structure Edit Distance Distribute Hash Table Cartesian Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  1. 1.ISTI-CNR, via G. Moruzzi 1, 56124 PisaItaly
  2. 2.Masaryk University, BrnoCzech Republic

Personalised recommendations