MPI-INF Logo
Campus Event Calendar

Event Entry

New for: D1, D2, D3, D4, D5

What and Who

Query Routing in P2P Web Search Engine

Pavel Serdyukov
IMPRS
IMPRS Masters' Lunch
AG 1, AG 2, AG 3, AG 4, AG 5  
AG Audience

Date, Time and Location

Tuesday, 1 June 2004
13:00
60 Minutes
46.1 - MPII
024
Saarbrücken

Abstract

"Query Routing in a Peer-to-Peer Web Search Engine"

In peer-to-peer systems request routing either proceeds along virtual neighborhood relations in a
Gnutella-style message flooding scheme or uses an overlay network structure, typically based on Chord-style
distributed hash tables, that forwards the request to the one or few nodes that have the requested data.

The goal of presented Master thesis project is to investigate how these routing mechanisms should be best exploited
for queries in a peer-to-peer Web search engine. In this setting every peer has local index lists for the document
that it has previously crawled.

So, the main issue, which should be settled, is to select the most suitable small number of peers to be contacted out
of a larger set of suitable candidates, using the richness and quality of the peers local index lists.

Contact

Kerstin Meyer-Ross
0681 - 9325 226
--email hidden
passcode not visible
logged in users only

Christine Kiesel, 06/22/2004 10:14
Christine Kiesel, 05/26/2004 10:09
Christine Kiesel, 05/10/2004 12:50
Christine Kiesel, 05/10/2004 12:48 -- Created document.