2013 IEEE 29th International Conference on Data Engineering (ICDE) (2009)
Mar. 29, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2009.109
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.
Top-K Query Processing, Budget Constraint, Algorithm
Haggai Roitman, Chen Li, Yosi Mass, Gerhard Weikum, Michal Shmueli-Scheuer, Ralf Schenkel, "Best-Effort Top-k Query Processing Under Budgetary Constraints", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 928-939, 2009, doi:10.1109/ICDE.2009.109