Indexing the Distance Using Chord: A Distributed Similarity Search Structure
| Authors | |
|---|---|
| Year of publication | 2005 |
| Type | Article in Proceedings |
| Conference | 8th International Workshop of the DELOS Network of Excellence on Digital Libraries |
| MU Faculty or unit | |
| Citation | |
| Web | http://www.fi.muni.cz/~xnovak8/papers/novakzezula05delos.pdf |
| Field | Informatics |
| Keywords | indexing; similarity; peer-to-peer |
| Description | The need of search mechanisms based on data content rather then attributes values has recently lead to formation of the metric-based similarity retrieval. The computational complexity of such retrieval and the large volume of processed data call for distributed processing. In this paper, we propose chiDistance, a distributed data structure for similarity search in metric spaces. The structure is based on the idea of a vector-based index method iDistance which enables to transform the issue of similarity search into the one-dimensional range search problem. A~Peer-to-Peer system based on the Chord protocol is created to distribute the storage space and to parallelize the execution of similarity queries. In the experiments conducted on our prototype implementation we study the system performance concentrating on several aspects of parallelism of the range search algorithm. |
| Related projects: |