English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Efficiently Handling Dynamics in Distributed Link Based Authority Analysis

Xavier Parreira, J., Michel, S., & Weikum, G. (2008). Efficiently Handling Dynamics in Distributed Link Based Authority Analysis. In J. Bailey, D. Maier, K.-D. Schewe, B. Thalheim, & X. S. Wang (Eds.), Web Information Systems Engineering – WISE 2008: 9th International Conference (pp. 36-49). Berlin: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1B7F-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1B80-2
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Xavier Parreira, Josiane1, Author           
Michel, Sebastian1, Author           
Weikum, Gerhard1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 Abstract: Link based authority analysis is an important tool for ranking resources in social networks and other graphs. Previous work have presented JXP, a decentralized algorithm for computing PageRank scores. The algorithm is designed to work in distributed systems, such as peer-to-peer (P2P) networks. However, the dynamics of the P2P networks, one if its main characteristics, is currently not handled by the algorithm. This paper shows how to adapt JXP to work under network churn. First, we present a distributed algorithm that estimates the number of distinct documents in the network, which is needed in the local computation of the PageRank scores. We then present a method that enables each peer to detect other peers leave and to update its view of the network. We show that the number of stored items in the network can be efficiently estimated, with little overhead on the network traffic. Second, we present an extension of the original JXP algorithms that can cope with network and content dynamics. We show by a comprehensive performance analysis the practical usability of our approach. The proposed estimators together with the changes in the core JXP components allow for a fast and authority score computation even under heavy churn. We believe that this is the last missing step toward the application of distributed PageRank measures in real-life large-scale applications.

Details

show
hide
Language(s): eng - English
 Dates: 2009-03-312008
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 428256
DOI: 10.1007/978-3-540-85481-4
URI: http://www.springerlink.com/content/95kkh541563x2201/
Other: Local-ID: C125756E0038A185-302DF0CE42CC5720C12575070046AFCC-ParreiraMW08
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Auckland, New Zealand
Start-/End Date: 2008-09-01 - 2008-09-03

Legal Case

show

Project information

show

Source 1

show
hide
Title: Web Information Systems Engineering – WISE 2008 : 9th International Conference
Source Genre: Proceedings
 Creator(s):
Bailey, James, Editor
Maier, David, Editor
Schewe, Klaus-Dieter, Editor
Thalheim, Bernhard, Editor
Wang, Xiaoyang Sean, Editor
Affiliations:
-
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 36 - 49 Identifier: ISBN: 3-540-85480-0

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -