Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Efficient and Decentralized PageRank Approximation in a Peer-to-Peer Web Search Network

Parreira, J. X., Donato, D., Michel, S., & Weikum, G. (2006). Efficient and Decentralized PageRank Approximation in a Peer-to-Peer Web Search Network. In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB 2006) (pp. 415-426). New York, USA: ACM.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22A7-6 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22A8-4
Genre: Konferenzbeitrag

Dateien

einblenden: Dateien
ausblenden: Dateien
:
jxp_vldb2006.pdf (beliebiger Volltext), 604KB
 
Datei-Permalink:
-
Name:
jxp_vldb2006.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Parreira, Josiane Xavier1, Autor           
Donato, Debora, Autor
Michel, Sebastian1, Autor           
Weikum, Gerhard1, Autor           
Dayal, Umeshwar, Herausgeber
Whang, Kyu-Young, Herausgeber
Lomet, David B., Herausgeber
Alonso, Gustavo, Herausgeber
Lohman, Guy M., Herausgeber
Kersten, Martin L., Herausgeber
Cha, Sang Kyun, Herausgeber
Kim, Young-Kuk, Herausgeber
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: PageRank-style (PR) link analyses are a cornerstone of Web search engines and Web mining, but they are computationally expensive. Recently, various techniques have been proposed for speeding up these analyses by distributing the link graph among multiple sites. However, none of these advanced methods is suitable for a fully decentralized PR computation in a peer-to-peer (P2P) network with autonomous peers, where each peer can independently crawl Web fragments according to the user's thematic interests. In such a setting the graph fragments that different peers have locally available or know about may arbitrarily overlap among peers, creating additional complexity for the PR computation. This paper presents the JXP algorithm for dynamically and collaboratively computing PR scores of Web pages that are arbitrarily distributed in a P2P network. The algorithm runs at every peer, and it works by combining locally computed PR scores with random meetings among the peers in the network. It is scalable as the number of peers on the network grows, and experiments as well as theoretical arguments show that JXP scores converge to the true PR scores that one would obtain by a centralized computation.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2007-04-102006
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: New York, USA : ACM
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 314656
Anderer: Local-ID: C1256DBF005F876D-612CD17494FD224DC125718000419F51-ParreiraDMW06
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Seoul, Korea
Start-/Enddatum: 2006-09-12

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB 2006)
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: New York, USA : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 415 - 426 Identifikator: ISBN: 1-59593-385-9