On Scalability of the Similarity Search in the World of Peers

BATKO, Michal, David NOVÁK, Fabrizio FALCHI and Pavel ZEZULA. On Scalability of the Similarity Search in the World of Peers. In InfoScale '06: Proceedings of the 1st international conference on Scalable information systems. New York, NY, USA: ACM Press, 2006, p. 1-12. ISBN 1-59593-428-6.

Basic information

Original name

On Scalability of the Similarity Search in the World of Peers

Name in Czech

O škálovatelnosti podobnostního hledání ve světě sobě rovných

Authors

BATKO, Michal (203 Czech Republic, guarantor, belonging to the institution), David NOVÁK (203 Czech Republic, belonging to the institution), Fabrizio FALCHI (380 Italy, belonging to the institution) and Pavel ZEZULA (203 Czech Republic, belonging to the institution)

Edition

New York, NY, USA, InfoScale '06: Proceedings of the 1st international conference on Scalable information systems, p. 1-12, 12 pp. 2006

Publisher

ACM Press

---

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

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

Publication form

printed version "print"

References:

URL

RIV identification code

RIV/00216224:14330/06:00015365

Organization unit

Faculty of Informatics

ISBN

1-59593-428-6

Keywords in English

distributed data structures; peer-to-peer; similarity search; indexing

Tags

DISA, distributed data structures, indexing, Peer-to-Peer, similarity search

Tags

International impact, Reviewed

---

Abstract

V originále

Due to the increasing complexity of current digital data, similarity search has become a fundamental computational task in many applications. Unfortunately, its costs are still high and the linear scalability of single server implementations prevents from efficient searching in large data volumes. In this paper, we shortly describe four recent scalable distributed similarity search techniques and study their performance of executing queries on three different datasets. Though all the methods employ parallelism to speed up query execution, different advantages for different objectives have been identified by experiments. The reported results can be exploited for choosing the best implementations for specific applications. They can also be used for designing new and better indexing structures in the future.

In Czech

Publikace popisuje a podrobne porovnava ctyri distribuovane datove struktury pro podobnostni vyhledavani v metrickych prostorech, ktere jsou zalozeny na paradigmatu peer-to-peer. Vysledky porovnani mohou byt vyuzity pri vyberu vhodne implementace pro konkretni aplikaci.

---

Links

GD102/05/H050, research and development project	Name: Integrovaný přístup k výchově studentů DSP v oblasti paralelních a distribuovaných systémů Investor: Czech Science Foundation, Integrated approach to education of PhD students in the area of parallel and distributed systems
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)