Indexing the Distance Using Chord: A Distributed Similarity Search Structure

NOVÁK, David and Pavel ZEZULA. Indexing the Distance Using Chord: A Distributed Similarity Search Structure. In 8th International Workshop of the DELOS Network of Excellence on Digital Libraries. Schloss Dagstuhl, Germany: Neuveden, 2005, p. 94-108.

Basic information

Original name

Indexing the Distance Using Chord: A Distributed Similarity Search Structure

Name in Czech

Indexování vzdálenosti pomocí Chordu: Distribuovaná struktura pro podobnostní vyhledávání

Authors

NOVÁK, David (203 Czech Republic, guarantor) and Pavel ZEZULA (203 Czech Republic)

Edition

Schloss Dagstuhl, Germany, 8th International Workshop of the DELOS Network of Excellence on Digital Libraries, p. 94-108, 15 pp. 2005

Publisher

Neuveden

---

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

URL

RIV identification code

RIV/00216224:14330/05:00013436

Organization unit

Faculty of Informatics

Keywords in English

indexing; similarity; peer-to-peer

Tags

DISA, indexing, Peer-to-Peer, similarity

---

Abstract

V originále

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.

In Czech

Práce navrhuje novou distribuovanou datovou strukturu, která podporuje podobnostní hledání používající obecný metrický prostor jako datovou abstrakci.

---

Links

1ET100300419, research and development project

Name: Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu Investor: Academy of Sciences of the Czech Republic, Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization)