Name
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 have a significantly higher quality than those of state-of-the-art budget-oblivious solutions. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICDE.2009.109 | ICDE |
Keywords | Field | DocType |
financial management,query processing,budget-aware scheduling algorithm,budgetary constraints,decision making,top-k query processing,Algorithm,Budget Constraint,Top-K Query Processing | Approximation algorithm,Budget constraint,Scheduling (computing),Computer science,Theoretical computer science,Processor scheduling,Probability density function,Database,Financial management | Conference |
ISSN | Citations | PageRank |
1084-4627 | 21 | 0.83 |
References | Authors | |
15 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michal Shmueli-Scheuer | 1 | 89 | 16.11 |
| Chen Li | 2 | 2816 | 196.16 |
| Yosi Mass | 3 | 574 | 60.91 |
| Haggai Roitman | 4 | 314 | 32.07 |
| Ralf Schenkel | 5 | 1641 | 114.11 |
| Gerhard Weikum | 6 | 12710 | 2146.01 |