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
Triantafillou, Peter
Weikum, Gerhard

dblp
dblp
dblp

Not MPG Author(s):

Triantafillou, Peter

Editor(s):

Böhm, Klemens
Jensen, Christian S.
Haas, Laura M.
Kersten, Martin L.
Larson, Per-Ake
Ooi, Beng Chin

dblp
dblp
dblp
dblp
dblp
dblp

Not MPII Editor(s):

Böhm, Klemens
Jensen, Christian S.
Haas, Laura M.
Kersten, Martin L.
Larson, Per-Ake
Ooi, Beng Chin

BibTeX cite key*:

MichelTW05

Title, Booktitle

Title*:

KLEE: A Framework for Distributed Top-k Query Algorithms

Booktitle*:

Proceedings of the 31st International Conference on Very Large Data Bases (VLDB 2005)

Event, URLs

URL of the conference:

http://www.vldb2005.org

URL for downloading the paper:

http://www.vldb2005.org/program/paper/thu/p637-michel.pdf

Event Address*:

Trondheim, Norway

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

30 August 2005

Event End Date:

2 September 2005

Publisher

Name*:

ACM

URL:

http://www.acm.org

Address*:

New York, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

637-648

Year*:

2005

VG Wort Pages:

57

ISBN/ISSN:

1-59593-154-6; 1-59593-177-5

Sequence Number:


DOI:




Note, Abstract, ©

Note:

Acceptance ratio 1:6

(LaTeX) Abstract:

This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query are distributed across a number of data peers and the computational costs include network latency, bandwidth consumption, and local peer work. We present KLEE, a novel algorithmic framework for distributed top-k queries, designed for high performance and flexibility. KLEE makes a strong case for approximate top-k algorithms over widely distributed data sources. It shows how great gains in efficiency can be enjoyed at low result-quality penalties. Further, KLEE affords the query-initiating peer the flexibility to trade-off result quality and expected performance and to trade-off the number of communication phases engaged during query execution versus network bandwidth performance. We have implemented KLEE and related algorithms and conducted a comprehensive performance evaluation. Our evaluation employed real-world and synthetic large, web-data collections, and query benchmarks. Our experimental results show that KLEE can achieve major performance gains in terms of network bandwidth, query response times, and much lighter peer loads, all with small errors in result precision and other result-quality measures.



Download
Access Level:

Internal

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{MichelTW05,
AUTHOR = {Michel, Sebastian and Triantafillou, Peter and Weikum, Gerhard},
EDITOR = {B{\"o}hm, Klemens and Jensen, Christian S. and Haas, Laura M. and Kersten, Martin L. and Larson, Per-Ake and Ooi, Beng Chin},
TITLE = {{KLEE}: A Framework for Distributed Top-k Query Algorithms},
BOOKTITLE = {Proceedings of the 31st International Conference on Very Large Data Bases (VLDB 2005)},
PUBLISHER = {ACM},
YEAR = {2005},
PAGES = {637--648},
ADDRESS = {Trondheim, Norway},
ISBN = {1-59593-154-6},
; ISBN = {1-59593-177-5},
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)
Adriana Davidescu
Created
06/03/2005 03:51:35 PM
Revisions
16.
15.
14.
13.
12.
Editor(s)
Adriana Davidescu
Ralf Schenkel
Adriana Davidescu
Christine Kiesel
Christine Kiesel
Edit Dates
20.07.2007 17:41:51
30.03.2007 16:17:34
11.08.2006 13:43:22
14.06.2006 14:31:51
20.01.2006 13:29:04