A Reproducible Benchmark for P2P Retrieval

A Reproducible Benchmark for P2P RetrievalThomas Neumann Matthias Bender Sebastian MichelGerhard WeikumMax-Planck-Institut fur¨ InformatikJune 30, 2006Thomas Neumann (MPI fur¨ Informatik) A Reproducible Benchmark for P2P Retrieval 1 / 19Overview1. Motivation2. Setting3. Data Corpus and Queries4. Data Placement5. Experiments6. ConclusionThomas Neumann (MPI fur¨ Informatik) A Reproducible Benchmark for P2P Retrieval 2 / 19Motivation - P2P RetrievalPeer lists (directory)term a: 17, 11,92, ... url w: 7, 48, 21, ...term f: 43, 65, 92, … term c: 13, 92, 45, ...url y: 37, 44, 12, ...`term c: 13, 92, 45, ...Book- url x: 75, 43, 12, ...Marks B0Local index X0url v: 73, 105, 17, ...Thomas Neumann (MPI fur¨ Informatik) A Reproducible Benchmark for P2P Retrieval 3 / 19Motivation - CurrentI many papers about P2P retrievalThomas Neumann (MPI fur¨ Informatik) A Reproducible Benchmark for P2P Retrieval 4 / 19Motivation - CurrentI many papers about P2P retrievalTop 10 m ulticast1.00.8Threshold0.6TPUTTPUT+H ash0.40.20.0NLAN R−REAL WorldCup DEC−64 DEC−128 NLAN R−203 Berkley−512Thomas Neumann (MPI fur¨ Informatik) A Reproducible Benchmark for P2P Retrieval 4 / 19Tot al m essage sizeMotivation - CurrentI many papers about P2P retrievalGOV ,c=10%140,000DTA120,000TPUT100,000X−TPUT80,000 KLEE 3KLEE 460,00040,00020,0000234NumberofQuery TermsThomas Neumann (MPI fur¨ Informatik) A Reproducible Benchmark for P2P Retrieval 4 / 19Bandwidth ...