de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  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

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: http://hdl.handle.net/11858/00-001M-0000-000F-1B7F-8 Versions-Permalink: http://hdl.handle.net/11858/00-001M-0000-000F-1B80-2
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Xavier Parreira, Josiane1, Autor              
Michel, Sebastian1, Autor              
Weikum, Gerhard1, Autor              
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, escidoc:24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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

einblenden:
ausblenden:
Sprache(n): eng - Englisch
 Datum: 2009-03-312008
 Publikationsstatus: Im Druck publiziert
 Seiten: -
 Ort, Verlag, Ausgabe: Berlin : Springer
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 428256
DOI: 10.1007/978-3-540-85481-4
URI: http://www.springerlink.com/content/95kkh541563x2201/
Anderer: Local-ID: C125756E0038A185-302DF0CE42CC5720C12575070046AFCC-ParreiraMW08
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Auckland, New Zealand
Start-/Enddatum: 2008-09-01 - 2008-09-03

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Web Information Systems Engineering – WISE 2008 : 9th International Conference
Genre der Quelle: Konferenzband
 Urheber:
Bailey, James, Herausgeber
Maier, David, Herausgeber
Schewe, Klaus-Dieter, Herausgeber
Thalheim, Bernhard, Herausgeber
Wang, Xiaoyang Sean, Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Berlin : Springer
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 36 - 49 Identifikator: ISBN: 3-540-85480-0

Quelle 2

einblenden:
ausblenden:
Titel: Lecture Notes in Computer Science
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: - Identifikator: -