Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

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

Action:

login to update

Options:








Author, Editor

Author(s):

Michel, Sebastian
Bender, Matthias
Triantafillou, Peter
Weikum, Gerhard

dblp
dblp
dblp
dblp

Not MPG Author(s):

Triantafillou, Peter

Editor(s):

Ioannidis, Yannis
Scholl, Marc H.
Schmidt, Joachim W.
Matthes, Florian
Hatzopoulos, Mike
Boehm, Klemens
Kemper, Alfons
Grust, Torsten
Boehm, Christian

dblp
dblp
dblp
dblp
dblp
dblp
dblp
dblp
dblp

Not MPII Editor(s):

Yoannidis, Yannis
Scholl, Marc H.
Schmidt, Joachim W.
Matthes, Florian
Hatzopoulos, Mike
Boehm, Klemens
Kemper, Alfons
Grust, Torsten
Boehm, Christian

BibTeX cite key*:

EDBT06

Title, Booktitle

Title*:

IQN Routing: Integrating Quality and Novelty in P2P Querying and Ranking

Booktitle*:

Advances in Database Technology - EDBT 2006: 10th International Conference on Extending Database Technology

Event, URLs

URL of the conference:

http://www.edbt2006.de/

URL for downloading the paper:

http://www.springerlink.com/content/x82q304028u65k7m/fulltext.pdf

Event Address*:

Munich, Germany

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

26 March 2006

Event End Date:

30 March 2006

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

3896

Number:


Month:

March

Pages:

149-166

Year*:

2006

VG Wort Pages:

44

ISBN/ISSN:

3-540-32960-9

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We consider a collaboration of peers autonomously crawling the Web.
A pivotal issue when designing a peer-to-peer (P2P) Web search engine in this environment
is \textit{query routing}: selecting a small subset of (a potentially very large number of relevant)
peers to contact to satisfy a keyword query. Existing approaches for query routing work well
on disjoint data sets. However, naturally, the peers' data collections often highly overlap,
as popular documents are highly crawled. Techniques for estimating the cardinality of the
overlap between sets, designed for and incorporated into information retrieval engines
are very much lacking. In this paper we present a comprehensive evaluation of appropriate
overlap estimators, showing how they can be incorporated into an efficient, iterative approach
to query routing, coined \textit{Integrated Quality Novelty (IQN)}. We propose to further
enhance our approach using histograms, combining overlap estimation with the available
score/ranking information. Finally, we conduct a performance evaluation in MINERVA,
our prototype P2P Web search engine.

URL for the Abstract:

http://dx.doi.org/10.1007/11687238_12

Keywords:

IQN, MINERVA, Query Routing, Overlap



Download
Access Level:

MPG

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Audience:

popular

Appearance:

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



BibTeX Entry:

@INPROCEEDINGS{EDBT06,
AUTHOR = {Michel, Sebastian and Bender, Matthias and Triantafillou, Peter and Weikum, Gerhard},
EDITOR = {Ioannidis, Yannis and Scholl, Marc H. and Schmidt, Joachim W. and Matthes, Florian and Hatzopoulos, Mike and Boehm, Klemens and Kemper, Alfons and Grust, Torsten and Boehm, Christian},
TITLE = {{IQN} Routing: Integrating Quality and Novelty in {P2P} Querying and Ranking},
BOOKTITLE = {Advances in Database Technology - EDBT 2006: 10th International Conference on Extending Database Technology},
PUBLISHER = {Springer},
YEAR = {2006},
VOLUME = {3896},
PAGES = {149--166},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Munich, Germany},
MONTH = {March},
ISBN = {3-540-32960-9},
}


Entry last modified by Ralf Schenkel, 03/30/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
11/17/2005 03:50:19 PM
Revisions
22.
21.
20.
19.
18.
Editor(s)
Ralf Schenkel
Christine Kiesel
Christine Kiesel
Adriana Davidescu
Adriana Davidescu
Edit Dates
30.03.2007 16:01:16
13.02.2007 22:21:51
08.02.2007 15:15:32
22.01.2007 16:22:11
22.01.2007 16:21:45