English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  JXP: Global Authority Scores in a P2P Network

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-26DE-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-26DF-8
Genre: Conference Paper

Files

show Files
hide Files
:
JXP_cameraready.pdf (Any fulltext), 271KB
 
File Permalink:
-
Name:
JXP_cameraready.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Parreira, Josiane Xavier1, Author           
Weikum, Gerhard1, Author           
Doan, AnHai, Editor
Neven, Frank, Editor
McCann, Robert, Editor
Jan Bex, Geert, Editor
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2006-06-202005
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 278907
Other: Local-ID: C1256DBF005F876D-13621FB99B672720C12570B6005B2DD0-XavierParreira2004
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Baltimore, Maryland, USA
Start-/End Date: 2005-06-16

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Eighth Iernational Workshop on the Web {\&} Databases (WebDB 2005) collocated with ACM SIGMOD/PODS 2005
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 31 - 36 Identifier: ISBN: 1-59593-065-5