0.25
0.5
0.75
1.25
1.5
1.75
2
Efficient and Decentralized PageRank Approximation in a P2P Web Search Network
Published on Feb 25, 20075915 Views
Related categories
Chapter list
Efficient and Decentralized PageRank Approximation in a P2P Network00:00
Outline00:02
Motivation00:22
Motivation00:30
Motivation00:35
Motivation00:49
Related Work01:22
JXP Algorithm02:01
World Node02:35
World Node02:44
World Node02:57
World Node03:09
World Node03:12
World Node03:24
World Node03:38
World Node04:03
The Algorithm04:16
The Algorithm04:41
Example05:40
Example05:57
Example06:02
Peer Selection Strategy06:26
Peer Selection Strategy07:09
Peer Selection Strategy07:22
Peer Selection Strategy07:37
MIPs08:35
MIPs Example08:39
Pre-meetings Strategy08:46
Pre-meetings Strategy10:43
Mathematical Analysis11:07
Mathematical Analysis12:04
Mathematical Analysis13:12
Mathematical Analysis13:32
Mathematical Analysis14:49
Mathematical Analysis15:02
Mathematical Analysis15:36
Setup15:58
Setup16:04
Setup17:42
Overall performance comparison18:21
Overall performance comparison18:26
JXP in P2P Search18:30
Results19:22
Conclusions and Ongoing Work19:34