M-Chord: A Scalable Distributed Similarity Search Structure
| Authors | |
|---|---|
| Year of publication | 2006 |
| Type | Article in Proceedings |
| Conference | InfoScale '06: Proceedings of the 1st international conference on Scalable information systems |
| MU Faculty or unit | |
| Citation | |
| Web | http://doi.acm.org/10.1145/1146847.1146866 |
| Field | Informatics |
| Keywords | distributed data structures; peer-to-peer; similarity search; indexing |
| Description | The need for a retrieval based not on the attribute values but on the very data content has recently led to rise of the metric-based similarity search. The computational complexity of such a retrieval and large volumes of processed data call for distributed processing which allows to achieve scalability. In this paper, we propose M-Chord, a distributed data structure for metric-based similarity search. The structure takes advantage of the idea of a vector index method iDistance in order to transform the issue of similarity searching into the problem of interval search in one dimension. The proposed peer-to-peer organization, based on the Chord protocol, distributes the storage space and parallelizes the execution of similarity queries. Promising features of the structure are validated by experiments on the prototype implementation and two real-life datasets. |
| Related projects: |