de.mpg.escidoc.pubman.appbase.FacesBean
English

# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### JXP: Global Authority Scores in a P2P Network

##### MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45166

Parreira,  Josiane Xavier
Databases and Information Systems, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

##### Locator
There are no locators available
##### Fulltext (public)
There are no public fulltexts available
##### Supplementary Material (public)
There is no public supplementary material available
##### Citation

Parreira, J. X., & Weikum, G. (2005). JXP: Global Authority Scores in a P2P Network. In Proceedings of the Eighth Iernational Workshop on the Web {\&} Databases (WebDB 2005) collocated with ACM SIGMOD/PODS 2005 (pp. 31-36). New York, USA: ACM.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-26DE-A
##### Abstract
This document presents the \textit{JXP} algorithm for dynamically and collaboratively computing PageRank-style authority scores of Web pages distributed in a P2P network. In the architecture that we pursue, every peer crawls and indexes Web fragments at its discretion, driven by the thematic profile or overlay neighborhood of the peer. The JXP algorithm runs at every peer, and is initialized by a local authority computation on the basis of the locally available Web fragment. Peers collaborate by periodically meeting'' with other peers in the network. Whenever two peers meet they exchange their local information and use this new information to improve their local authority scores. Even though only local computations are performed, the JXP scores approximate the global importance of pages in the entire network. The storage demand of each peer is linear in the number of Web pages and the locally stored Web fragment. Experiments show the quality and practical viability of the JXP algorithm.