A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimizing top-k queries for middleware access
2007
ACM Transactions on Database Systems
This article studies optimizing top-k queries in middlewares. While many assorted algorithms have been proposed, none is generally applicable to a wide range of possible scenarios. Existing algorithms lack both the "generality" to support a wide range of access scenarios and the systematic "adaptivity" to account for runtime specifics. To fulfill this critical lacking, we aim at taking a costbased optimization approach: By runtime search over a space of algorithms, cost-based optimization is
doi:10.1145/1206049.1206054
fatcat:p5rqu5cvyje53f7yvsvddcxyse