@inproceedings{eisenhardt2006_16359,
  title = {Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas and Blank, Daniel and El Allali, Soufyane},
  year = {2006},
  booktitle = {Proceedings : ISM 2006, Eighth IEEE International Symposium on Multimedia : 11 - 13 December 2006, San Diego, CA},
  pages = {823-830},
  publisher = {IEEE},
  address = {Los Alamitos, Calif.},
  doi = {10.1109/ISM.2006.47},
  url = {https://fis.uni-bamberg.de/handle/uniba/16359},
  language = {deu},
  abstract = {In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. One way to address it is using data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. There are two main contributions of this paper. We extend earlier work, adding a data source selection method for high-dimensional vector data, comparing different peer ranking schemes. More importantly, we present a method that uses progressive stepwise data exchange between peers to better each peer's summary and therefore improve the system's performance.},
  keywords = {Efficient Image Retrieval, Peer-to-Peer Networks}
}
