2008
Journal article  Open Access

Scalability comparison of Peer-to-Peer similarity-search structures

Batko M., Novak D., Falchi F., Zezula P.

Systems and Software  Content Analysis and Indexing  Hardware and Architecture  Software  Information Search and Retrieval  Computer Networks and Communications  Clustering  Similarity search 

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.

Source: Future generation computer systems 24 (2008): 834–848. doi:10.1016/j.future.2007.07.012

Publisher: North-Holland, Amsterdam , Paesi Bassi


Metrics



Back to previous page
BibTeX entry
@article{oai:it.cnr:prodotti:44195,
	title = {Scalability comparison of Peer-to-Peer similarity-search structures},
	author = {Batko M. and Novak D. and Falchi F. and Zezula P.},
	publisher = {North-Holland, Amsterdam , Paesi Bassi},
	doi = {10.1016/j.future.2007.07.012},
	journal = {Future generation computer systems},
	volume = {24},
	pages = {834–848},
	year = {2008}
}