Peer-to-peer search revisited
Staff - Faculty of Informatics
Start date: 23 January 2012
End date: 24 January 2012
The Faculty of Informatics is pleased to announce a seminar given by Djoerd Heimstra
DATE: Monday, January 23rd, 2012
PLACE: USI Università della Svizzera italiana, room SI-006, Informatics building (Via G. Buffi 13)
TIME: 10.30
ABSTRACT:
I present a new generation of peer-to-peer search systems inspired by BitTorrent. In our peer-to-peer search approach, each peer is both a search client (a system that submits queries to the network) and a search server (a system that answers queries). Peers that submit a lot of queries, will have to answer a lot of queries as well. Peers may answer queries by providing their own indexed collection, or by caching search results. I present simulations that show the effects of search result caching on query load balancing. I also show how the network can learn from the search result snippets without downloading or crawling the documents themselves. Finally, I will show an approach to include results from structured databases and other deep web search sites into the peer-to-peer search network.
BIO:
Dr. Djoerd Hiemstra is associate professor at the database group of the University of Twente in the Netherlands. He wrote an often cited Ph.D. thesis on language models for information retrieval and contributed to over 150 research papers in the field of information retrieval. His research interests include formal models of information retrieval, XML retrieval, multimedia retrieval, and peer-to-peer retrieval. For more information, see: http://www.cs.utwente.nl/~hiemstra/
HOST: Prof. Fabio Crestani
