Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2017) | last year (2016) | two years ago (2015) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Shmueli-Scheuer, Michal
Li, Chen
Mass, Yosi
Roitman, Haggai
Schenkel, Ralf
Weikum, Gerhard

dblp
dblp
dblp
dblp
dblp
dblp

Not MPG Author(s):

Shmueli-Scheuer, Michal
Li, Chen
Mass, Yosi
Roitman, Haggai

Editor(s):





BibTeX cite key*:

ShmueliSLMRSW09

Title, Booktitle

Title*:

Best Effort Top-K Query Processing Under Budgetary Constraints

Booktitle*:

25th IEEE International Conference on Data Engineering, ICDE 2009 : proceedings

Event, URLs

URL of the conference:

http://i.cs.hku.hk/icde2009/

URL for downloading the paper:

http://dx.doi.org/10.1109/ICDE.2009.109

Event Address*:

Shanghai, China

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

29 March 2009

Event End Date:

4 April 2009

Publisher

Name*:

IEEE Computer Society

URL:


Address*:

Los Alamitos, CA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

928-939

Year*:

2009

VG Wort Pages:


ISBN/ISSN:

978-0-7695-3545-6

Sequence Number:


DOI:

10.1109/ICDE.2009.109



Note, Abstract, ©


(LaTeX) Abstract:

We consider a novel problem of top-k query processing
under budget constraints. We provide both a framework
and a set of algorithms to address this problem. Existing
algorithms for top-k processing are budget-oblivious, i.e., they do
not take budget constraints into account when making scheduling
decisions, but focus on the performance to compute the final top-k
results. Under budget constraints, these algorithms therefore
often return results that are a lot worse than the results that can
be achieved with a clever, budget-aware scheduling algorithm.
This paper introduces novel algorithms for budget-aware top-k
processing that produce results that are significantly better than
those of state-of-the-art budget-obvlivious solutions.



Download
Access Level:

Public

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{ShmueliSLMRSW09,
AUTHOR = {Shmueli-Scheuer, Michal and Li, Chen and Mass, Yosi and Roitman, Haggai and Schenkel, Ralf and Weikum, Gerhard},
TITLE = {Best Effort Top-K Query Processing Under Budgetary Constraints},
BOOKTITLE = {25th IEEE International Conference on Data Engineering, ICDE 2009 : proceedings},
PUBLISHER = {IEEE Computer Society},
YEAR = {2009},
PAGES = {928--939},
ADDRESS = {Shanghai, China},
ISBN = {978-0-7695-3545-6},
DOI = {10.1109/ICDE.2009.109},
}


Entry last modified by Anja Becker, 03/23/2010
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)
[Library]
Created
09/23/2008 03:20:37 PM
Revisions
5.
4.
3.
2.
1.
Editor(s)
Anja Becker
Ralf Schenkel
Martin Theobald
Martin Theobald
Martin Theobald
Edit Dates
23.03.2010 13:59:31
29.07.2009 17:15:17
04/23/2009 03:00:02 PM
04/15/2009 03:22:20 PM
23.09.2008 15:34:14
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section