Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Discovering and Exploiting Keyword and Attribute-Value Co-occurrences to Improve P2P Routing Indices

Michel, S., Bender, M., Ntarmos, N., Triantafillou, P., Weikum, G., & Zimmer, C. (2006). Discovering and Exploiting Keyword and Attribute-Value Co-occurrences to Improve P2P Routing Indices. In ACM 15th Conference on Information and Knowledge Management (CIKM2006) (pp. 172-181). New York, USA: ACM.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2293-1 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2294-0
Genre: Konferenzbeitrag

Dateien

einblenden: Dateien
ausblenden: Dateien
:
cikm396-michel.pdf (beliebiger Volltext), 386KB
 
Datei-Permalink:
-
Name:
cikm396-michel.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:
Michel, Sebastian1, Autor           
Bender, Matthias1, Autor           
Ntarmos, Nikos, Autor
Triantafillou, Peter1, Autor           
Weikum, Gerhard1, Autor           
Zimmer, Christian1, Autor           
Yu, Philip S., Herausgeber
Tsotras, Vassilis J., Herausgeber
Fox, Edward A., Herausgeber
Liu, Bing, Herausgeber
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Peer-to-Peer (P2P) search requires intelligent decisions for {\em query routing}: selecting the best peers to which a given query, initiated at some peer, should be forwarded for retrieving additional search results. These decisions are based on statistical summaries for each peer, which are usually organized on a per-keyword basis and managed in a distributed directory of routing indices. Such architectures disregard the possible correlations among keywords. Together with the coarse granularity of per-peer summaries, which are mandated for scalability, this limitation may lead to poor search result quality. This paper develops and evaluates two solutions to this problem, {\em sk-STAT} based on single-key statistics only, and {\em mk-STAT} based on additional multi-key statistics. For both cases, hash sketch synopses are used to compactly represent a peer's data items and are efficiently disseminated in the P2P network to form a decentralized directory. Experimental studies with Gnutella and Web data demonstrate the viability and the trade-offs of the approaches.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2007-04-042006
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: New York, USA : ACM
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 314379
Anderer: Local-ID: C1256DBF005F876D-5FC313691AC3093EC12571BE002DB11F-CIKM2006
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Arlington, USA
Start-/Enddatum: 2006-11-11

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: ACM 15th Conference on Information and Knowledge Management (CIKM2006)
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: New York, USA : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 172 - 181 Identifikator: ISBN: 1-59593-433-2