Publication details

Scalability Comparison of Peer-to-Peer Similarity Search Structures

Investor logo

BATKO Michal NOVÁK David FALCHI Fabrizio ZEZULA Pavel

Year of publication 2008
Type Article in Periodical
Magazine / Source Future Generation Computer Systems
MU Faculty or unit

Faculty of Informatics

Web DOI identifier of the paper
Field Informatics
Keywords Similarity search; Scalability; Metric space; Distributed index structures; Peer-to-Peer networks
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 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.
Related projects:

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

More info