Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Michel, Sebastian
Bender, Matthias
Ntarmos, Nikos
Triantafillou, Peter
Weikum, Gerhard
Zimmer, Christian

dblp
dblp
dblp
dblp
dblp
dblp

Not MPG Author(s):

Ntarmos, Nikos
Triantafillou, Peter

Editor(s):

Yu, Philip S.
Tsotras, Vassilis J.
Fox, Edward A.
Liu, Bing

dblp
dblp
dblp
dblp

Not MPII Editor(s):

Yu, Philip S.
Tsotras, Vassilis J.
Fox, Edward A.
Liu, Bing

BibTeX cite key*:

CIKM2006

Title, Booktitle

Title*:

Discovering and Exploiting Keyword and Attribute-Value Co-occurrences to Improve P2P Routing Indices

Booktitle*:

ACM 15th Conference on Information and Knowledge Management (CIKM2006)

Event, URLs

URL of the conference:

http://sa1.sice.umkc.edu/cikm2006/

URL for downloading the paper:

http://delivery.acm.org/10.1145/1190000/1183643/p172-michel.pdf?key1=1183643&key2=4132490711&coll=GUIDE&dl=GUIDE&CFID=10912727&CFTOKEN=53379408

Event Address*:

Arlington, USA

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

11 November 2006

Event End Date:

16 November 2006

Publisher

Name*:

ACM

URL:


Address*:

New York, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

172-181

Year*:

2006

VG Wort Pages:

55

ISBN/ISSN:

1-59593-433-2

Sequence Number:


DOI:




Note, Abstract, ©

Note:

Acceptance Ratio: 1:6

(LaTeX) Abstract:

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.

URL for the Abstract:

http://portal.acm.org/citation.cfm?doid=1183614.1183643#abstract

Keywords:

P2P, Minerva, Query Routing, Correlations


Personal Comments:

Acceptance Ratio: 15% (Full), 10% (Poster); 537 Submissions

Download
Access Level:

MPG

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{CIKM2006,
AUTHOR = {Michel, Sebastian and Bender, Matthias and Ntarmos, Nikos and Triantafillou, Peter and Weikum, Gerhard and Zimmer, Christian},
EDITOR = {Yu, Philip S. and Tsotras, Vassilis J. and Fox, Edward A. and Liu, Bing},
TITLE = {Discovering and Exploiting Keyword and Attribute-Value Co-occurrences to Improve {P2P} Routing Indices},
BOOKTITLE = {ACM 15th Conference on Information and Knowledge Management (CIKM2006)},
PUBLISHER = {ACM},
YEAR = {2006},
PAGES = {172--181},
ADDRESS = {Arlington, USA},
ISBN = {1-59593-433-2},
NOTE = {Acceptance Ratio: 1:6},
}


Entry last modified by Adriana Davidescu, 07/20/2007
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Matthias Bender
Created
08/02/2006 10:19:04 AM
Revisions
13.
12.
11.
10.
9.
Editor(s)
Adriana Davidescu
Petra Schaaf
Ralf Schenkel
Christine Kiesel
Christine Kiesel
Edit Dates
20.07.2007 15:38:59
04.04.2007 13:52:39
30.03.2007 15:44:50
09.02.2007 16:26:22
08.02.2007 14:58:43