Academic
Publications
Pagerank Computation and Keyword Search on Distributed Systems and P2P Networks

Pagerank Computation and Keyword Search on Distributed Systems and P2P Networks,10.1023/B:GRID.0000035202.38582.c8,Journal of Grid Computing,Karthikey

Pagerank Computation and Keyword Search on Distributed Systems and P2P Networks   (Citations: 11)
BibTex | RIS | RefWorks Download
This paper presents a fully distributed computation for Google's pagerank algorithm. The computation is based on solution of the matrix equation defining pageranks by a distributed implementation of asynchronous iteration. Pageranks for the documents stored on a web server or on a host in a peer-to-peer network are computed in place and stored with the documents. The matrix is never assembled and no crawls of the web are required. Continuously accurate pageranks are enabled by incremental computation of pageranks for documents as they are inserted onto a network storage host and incremental recomputation of pageranks when documents are deleted. Intrahost and intradomain dominance of document link structure is naturally exploited by the distributed asynchronous iteration algorithm.
Journal: Journal of Grid Computing - GRID , vol. 1, no. 3, pp. 291-307, 2003
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: