Sciweavers

Share
ICDE
2009
IEEE

Best-Effort Top-k Query Processing Under Budgetary Constraints

12 years 1 months ago
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.
Michal Shmueli-Scheuer, Chen Li, Yosi Mass, Haggai
Added 20 Oct 2009
Updated 20 Oct 2009
Type Conference
Year 2009
Where ICDE
Authors Michal Shmueli-Scheuer, Chen Li, Yosi Mass, Haggai Roitman, Ralf Schenkel, Gerhard Weikum
Comments (0)
books