Database Paper Browser

Back to papers

Efficient and Decentralized PageRank Approximation in a Peer-to-Peer Web Search Network

Summary: JXP enables decentralized PageRank approximation in a P2P Web-graph where peers crawl fragments with arbitrary overlap; no central controller is needed. Local PR updates plus random meetings among peers converge to the centralized PR values as the network scales. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9456
Venue
VLDB
Year
2006
Pagerank
4.6563056e-05
Overall Rank
7,767 | 45.97%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
5,442 RankMass Crawler: A Crawler with High Personalized PageRank Coverage Guarantee 2007 VLDB 5.5026403e-05
12,423 P2P Web Search: Make It Light, Make It Fly 2007 CIDR 4.1945683e-05
12,472 P2P Authority Analysis for Social Communities 2007 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2,539 Computing PageRank in a Distributed Internet Search System 2004 VLDB 8.5820857e-05
5,440 MINERVA: Collaborative P2P Search 2005 VLDB 5.5033018e-05
12,615 The BINGO! System for Information Portal Generation and Expert Web Search 2003 CIDR 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers