On scalability of the similarity search in the world of peers

Citations of this article
Mendeley users who have this article in their library.
Get full text


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. © 2006 ACM.




Batko, M., Novak, D., Falchi, F., & Zezula, P. (2006). On scalability of the similarity search in the world of peers. In ACM International Conference Proceeding Series (Vol. 152). https://doi.org/10.1145/1146847.1146867

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free