Electronic Proceedings Article
@InProceedings
Internet-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
Neumann, Thomas

dblp
dblp



Editor(s):





BibTeX cite key*:

MichelNeumannWebdb2007

Title, Conference

Title*:

Search for the Best but Expect the Worst - Distributed Top-k Queries over Decreasing Aggregated Scores


main.pdf (204.66 KB)

Booktitle*:

Proceedings of the Tenth International Workshop on the Web and Databases (WebDB 2007)

Event Address*:

Beijing, China

URL of the conference:

http://gemo.futurs.inria.fr/events/WebDB2007/index.html

Event Date*:
(no longer used):


URL for downloading the paper:

http://gemo.futurs.inria.fr/events/WebDB2007/Papers/p30.pdf

Event Start Date:

15 June 2007

Event End Date:

15 June 2007

Language:

English

Organization:


Publisher

Publisher's Name:

ACM

Publisher's URL:


Address*:

NY, USA

Type:


Vol, No, pp., Year

Series:


Volume:


Number:


Month:


Pages:

forthcoming



Sequence Number:


Year*:

2007

ISBN/ISSN:






Abstract, Links, ©

URL for Reference:


Note:


(LaTeX) Abstract:

We consider distributed top-k queries in wide-area networks where the index lists for the attribute values (or text terms) of a query are distributed across a number of data peers. In contrast to existing work, we exclusively consider distributed top-k queries over decreasing aggregated values. State-of-the-art distributed top-k algorithms usually depend on threshold propagation to reduce expensive data access across the network, but fail to compute tight thresholds if the aggregation function is decreasing. Decreasing aggregation functions, however, occur naturally, for example when considering conjunctive queries. Our proposed algorithms allow for efficient execution of these kind of queries, using a combination of threshold propagation and semijoin techniques. We demonstrate these techniques for the problem of top-k peer selection in a Peer-To-Peer Web search engine. Our experimental results on real-world data shows the superiority of our approach over pure thresholding.

URL for the Abstract:




Tags, Categories, Keywords:

Distributed Top-k Query Processing

HyperLinks / References / URLs:


Copyright Message:

Copyright is held by the author/owner.

Personal Comments:


Download
Access Level:

Public

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

BibTeX Entry:
@INPROCEEDINGS{MichelNeumannWebdb2007,
AUTHOR = {Michel, Sebastian and Neumann, Thomas},
TITLE = {Search for the Best but Expect the Worst - Distributed Top-k Queries over Decreasing Aggregated Scores},
BOOKTITLE = {Proceedings of the Tenth International Workshop on the Web and Databases (WebDB 2007)},
PUBLISHER = {ACM},
YEAR = {2007},
PAGES = {forthcoming},
ADDRESS = {Beijing, China},
}


Entry last modified by Martin Theobald, 04/15/2009
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)
Sebastian Michel
Created
07/13/2007 12:36:37 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Martin Theobald
Adriana Davidescu
Adriana Davidescu
Adriana Davidescu
Adriana Davidescu
Edit Dates
04/15/2009 02:02:47 PM
18.07.2007 15:29:37
18.07.2007 15:28:44
18.07.2007 15:28:27
13.07.2007 12:36:37
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
main.pdf