Web search engines designed on top of peer-to-peer (P2P) overlay networks
foresee attractive search scenarios operating at a large scale. However,
the design of effective indexing techniques for extremely large document
collections still raises a number of open technical challenges:
potentially huge bandwidth consumption during both indexing and querying
and also the unavailability of global document collection statistics.
Since a straightforward application of P2P solutions for Web search
generates unscalable indexing and search traffic, the authors propose a
novel indexing technique which maintains a global key index in structured
P2P overlays. The experimental results show reasonable indexing costs
while the retrieval quality is comparable to standard centralized
solutions with TF-IDF ranking. The new indexing scheme presented in this
paper is a contribution toward realistic P2P Web search engines.
Note: The presentation is based on the paper with the same name by Aberer,
Klemm et al.