Best-Effort top-k query processing under budgetary constraints

Michal Shmueli-Scheuer; Chen Li; Yosimass Mass; Haggai Roitman; Ralf Schenkel; Gerhard Weikum

doi:10.1109/ICDE.2009.109

Best-Effort top-k query processing under budgetary constraints

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Scopus citations

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 topk 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 have a significantly higher quality than those of state-of-the-art budget-oblivious solutions.

Original language	English
Title of host publication	Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009
Pages	928-939
Number of pages	12
DOIs	https://doi.org/10.1109/ICDE.2009.109
State	Published - 8 Jul 2009
Externally published	Yes
Event	25th IEEE International Conference on Data Engineering, ICDE 2009 - Shanghai, China Duration: 29 Mar 2009 → 2 Apr 2009

Publication series

Name	Proceedings - International Conference on Data Engineering
ISSN (Print)	1084-4627

Conference

Conference	25th IEEE International Conference on Data Engineering, ICDE 2009
Country/Territory	China
City	Shanghai
Period	29/03/09 → 2/04/09

ASJC Scopus subject areas

Software
Signal Processing
Information Systems

Access to Document

10.1109/ICDE.2009.109

Cite this

@inproceedings{5cad0ca3e1c14a1fba265f9350a61bee,

title = "Best-Effort top-k query processing under budgetary constraints",

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 topk 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 have a significantly higher quality than those of state-of-the-art budget-oblivious solutions.",

author = "Michal Shmueli-Scheuer and Chen Li and Yosimass Mass and Haggai Roitman and Ralf Schenkel and Gerhard Weikum",

year = "2009",

month = jul,

day = "8",

doi = "10.1109/ICDE.2009.109",

language = "English",

isbn = "9780769535456",

series = "Proceedings - International Conference on Data Engineering",

pages = "928--939",

booktitle = "Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009",

note = "25th IEEE International Conference on Data Engineering, ICDE 2009 ; Conference date: 29-03-2009 Through 02-04-2009",

}

Shmueli-Scheuer, M, Li, C, Mass, Y, Roitman, H, Schenkel, R & Weikum, G 2009, Best-Effort top-k query processing under budgetary constraints. in Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009., 4812466, Proceedings - International Conference on Data Engineering, pp. 928-939, 25th IEEE International Conference on Data Engineering, ICDE 2009, Shanghai, China, 29/03/09. https://doi.org/10.1109/ICDE.2009.109

Best-Effort top-k query processing under budgetary constraints. / Shmueli-Scheuer, Michal; Li, Chen; Mass, Yosimass et al.
Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009. 2009. p. 928-939 4812466 (Proceedings - International Conference on Data Engineering).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Best-Effort top-k query processing under budgetary constraints

AU - Shmueli-Scheuer, Michal

AU - Li, Chen

AU - Mass, Yosimass

AU - Roitman, Haggai

AU - Schenkel, Ralf

AU - Weikum, Gerhard

PY - 2009/7/8

Y1 - 2009/7/8

N2 - 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 topk 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 have a significantly higher quality than those of state-of-the-art budget-oblivious solutions.

AB - 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 topk 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 have a significantly higher quality than those of state-of-the-art budget-oblivious solutions.

UR - https://www.scopus.com/pages/publications/67649639299

U2 - 10.1109/ICDE.2009.109

DO - 10.1109/ICDE.2009.109

M3 - Conference contribution

AN - SCOPUS:67649639299

SN - 9780769535456

T3 - Proceedings - International Conference on Data Engineering

SP - 928

EP - 939

BT - Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009

T2 - 25th IEEE International Conference on Data Engineering, ICDE 2009

Y2 - 29 March 2009 through 2 April 2009

ER -

Best-Effort top-k query processing under budgetary constraints

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this