Document - A content-addressable network for similarity search in metric spaces

2007

Contribution to book Open Access

A content-addressable network for similarity search in metric spaces

Falchi F., Gennaro C., Zezula P.

H.3.3 Information Search and Retrieval H.3.4 Systems and Software Peer-to-peer Metric Space Content-Addressable Network Similarity search

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.

Source: Databases, Information Systems, and Peer-to-Peer Computing, edited by Gianluca Moro, Sonia Bergamaschi, Sam Joseph, Jean-Henry Morin and Aris M. Ouksel, pp. 98–110, 2007

Metrics

Back to previous page

Cite as

BibTeX entry

@inbook{oai:it.cnr:prodotti:43960,
	title = {A content-addressable network for similarity search in metric spaces},
	author = {Falchi F. and Gennaro C. and Zezula P.},
	doi = {10.1007/978-3-540-71661-7_9},
	booktitle = {Databases, Information Systems, and Peer-to-Peer Computing, edited by Gianluca Moro, Sonia Bergamaschi, Sam Joseph, Jean-Henry Morin and Aris M. Ouksel, pp. 98–110, 2007},
	year = {2007}
}