On Scalability of the Similarity Search in the World of Peers

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BATKO Michal NOVÁK David FALCHI Fabrizio ZEZULA Pavel

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

Faculty of Informatics

Citation
Web http://doi.acm.org/10.1145/1146847.1146867
Field Informatics
Keywords distributed data structures; peer-to-peer; similarity search; indexing
Description 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:

You are running an old browser version. We recommend updating your browser to its latest version.