Scalability comparison of Peer-to-Peer similarity search structures

  • Batko M
  • Novak D
  • Falchi F
 et al. 
  • 18


    Mendeley users who have this article in their library.
  • 17


    Citations of this article.


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 grow linearly on single server structures, which prevents them from efficient application on large data volumes. In this paper, we shortly describe four recent scalable distributed techniques for similarity search and study their performance in 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 would be helpful for choosing the best implementations for specific applications. They can also be used for designing new and better indexing structures in the future. © 2007 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Distributed index structures
  • Metric space
  • Peer-to-Peer networks
  • Scalability
  • Similarity search

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Michal Batko

  • David Novak

  • Fabrizio Falchi

  • Pavel Zezula

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free