Publication details
On Scalability of the Similarity Search in the World of Peers
| Basic information | |
|---|---|
| Original title: | On Scalability of the Similarity Search in the World of Peers |
| Authors: | Michal Batko, David Novák, Fabrizio Falchi, Pavel Zezula |
| Further information | |
|---|---|
| Citation: | BATKO, Michal  - NOVÁK, David - FALCHI, Fabrizio - ZEZULA, Pavel. 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. ISBN 1-59593-428-6, pp. 1-12. 30.5.2006, Hong Kong. |
| Original language: | English |
| Field: | Informatika |
| WWW: |  http://doi.acm.org/10.1145/1146847.1146867 |
| Type: | Article in Proceedings |
| Keywords: | distributed data structures; peer-to-peer; similarity search; indexing |
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.
Related projects:
- Integrated approach to education of PhD students in the area of parallel and distributed systems
- Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization)
