The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network

Josiane Xavier Parreira, Carlos Castillo, Debora Donato, Sebastian Michel, Gerhard Weikum

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

We present Juxtaposed approximate PageRank (JXP), a distributed algorithm for computing PageRank-style authority scores of Web pages on a peer-to-peer (P2P) network. Unlike previous algorithms, JXP allows peers to have overlapping content and requires no a priori knowledge of other peers' content. Our algorithm combines locally computed authority scores with information obtained from other peers by means of random meetings among the peers in the network. This computation is based on a Markov-chain state-lumping technique, and iteratively approximates global authority scores. The algorithm scales with the number of peers in the network and we show that the JXP scores converge to the true PageRank scores that one would obtain with a centralized algorithm. Finally, we show how to deal with misbehaving peers by extending JXP with a reputation model.

Original languageEnglish
Pages (from-to)291-313
Number of pages23
JournalVLDB Journal
Volume17
Issue number2
DOIs
Publication statusPublished - 1 Mar 2008
Externally publishedYes

Fingerprint

Peer to peer networks
Parallel algorithms
Markov processes
Websites

Keywords

  • Link analysis
  • Markov chain aggregation
  • Peer-to-peer systems
  • Social reputation
  • Web graph

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems

Cite this

The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network. / Parreira, Josiane Xavier; Castillo, Carlos; Donato, Debora; Michel, Sebastian; Weikum, Gerhard.

In: VLDB Journal, Vol. 17, No. 2, 01.03.2008, p. 291-313.

Research output: Contribution to journalArticle

Parreira, Josiane Xavier ; Castillo, Carlos ; Donato, Debora ; Michel, Sebastian ; Weikum, Gerhard. / The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network. In: VLDB Journal. 2008 ; Vol. 17, No. 2. pp. 291-313.
@article{0c864c4619f540b88dee123fff98c0c6,
title = "The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network",
abstract = "We present Juxtaposed approximate PageRank (JXP), a distributed algorithm for computing PageRank-style authority scores of Web pages on a peer-to-peer (P2P) network. Unlike previous algorithms, JXP allows peers to have overlapping content and requires no a priori knowledge of other peers' content. Our algorithm combines locally computed authority scores with information obtained from other peers by means of random meetings among the peers in the network. This computation is based on a Markov-chain state-lumping technique, and iteratively approximates global authority scores. The algorithm scales with the number of peers in the network and we show that the JXP scores converge to the true PageRank scores that one would obtain with a centralized algorithm. Finally, we show how to deal with misbehaving peers by extending JXP with a reputation model.",
keywords = "Link analysis, Markov chain aggregation, Peer-to-peer systems, Social reputation, Web graph",
author = "Parreira, {Josiane Xavier} and Carlos Castillo and Debora Donato and Sebastian Michel and Gerhard Weikum",
year = "2008",
month = "3",
day = "1",
doi = "10.1007/s00778-007-0057-y",
language = "English",
volume = "17",
pages = "291--313",
journal = "VLDB Journal",
issn = "1066-8888",
publisher = "Springer New York",
number = "2",

}

TY - JOUR

T1 - The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network

AU - Parreira, Josiane Xavier

AU - Castillo, Carlos

AU - Donato, Debora

AU - Michel, Sebastian

AU - Weikum, Gerhard

PY - 2008/3/1

Y1 - 2008/3/1

N2 - We present Juxtaposed approximate PageRank (JXP), a distributed algorithm for computing PageRank-style authority scores of Web pages on a peer-to-peer (P2P) network. Unlike previous algorithms, JXP allows peers to have overlapping content and requires no a priori knowledge of other peers' content. Our algorithm combines locally computed authority scores with information obtained from other peers by means of random meetings among the peers in the network. This computation is based on a Markov-chain state-lumping technique, and iteratively approximates global authority scores. The algorithm scales with the number of peers in the network and we show that the JXP scores converge to the true PageRank scores that one would obtain with a centralized algorithm. Finally, we show how to deal with misbehaving peers by extending JXP with a reputation model.

AB - We present Juxtaposed approximate PageRank (JXP), a distributed algorithm for computing PageRank-style authority scores of Web pages on a peer-to-peer (P2P) network. Unlike previous algorithms, JXP allows peers to have overlapping content and requires no a priori knowledge of other peers' content. Our algorithm combines locally computed authority scores with information obtained from other peers by means of random meetings among the peers in the network. This computation is based on a Markov-chain state-lumping technique, and iteratively approximates global authority scores. The algorithm scales with the number of peers in the network and we show that the JXP scores converge to the true PageRank scores that one would obtain with a centralized algorithm. Finally, we show how to deal with misbehaving peers by extending JXP with a reputation model.

KW - Link analysis

KW - Markov chain aggregation

KW - Peer-to-peer systems

KW - Social reputation

KW - Web graph

UR - http://www.scopus.com/inward/record.url?scp=38949190913&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38949190913&partnerID=8YFLogxK

U2 - 10.1007/s00778-007-0057-y

DO - 10.1007/s00778-007-0057-y

M3 - Article

VL - 17

SP - 291

EP - 313

JO - VLDB Journal

JF - VLDB Journal

SN - 1066-8888

IS - 2

ER -