1st International ICST Conference on Scalable Information Systems

Research Article

On scalability of the similarity search in the world of peers

  • @INPROCEEDINGS{10.1145/1146847.1146867,
        author={Michal  Batko and David  Novak and Fabrizio Falchi and Pavel  Zezula},
        title={On scalability of the similarity search in the world of peers},
        proceedings={1st International ICST Conference on Scalable Information Systems},
        publisher={ACM},
        proceedings_a={INFOSCALE},
        year={2006},
        month={6},
        keywords={},
        doi={10.1145/1146847.1146867}
    }
    
  • Michal Batko
    David Novak
    Fabrizio Falchi
    Pavel Zezula
    Year: 2006
    On scalability of the similarity search in the world of peers
    INFOSCALE
    ACM
    DOI: 10.1145/1146847.1146867
Michal Batko1, David Novak1, Fabrizio Falchi2, Pavel Zezula1
  • 1: Masaryk University, Brno, Czech Republic
  • 2: ISTI-CNR, Pisa, Italy

Abstract

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.