We consider a new online problem, called caching for queries and updates, which encompasses three expansions to standard caching: requests can be for multiple data objects (or "file bundles"), requests can be queries that return results much smaller than the data they access, or there may be updates to the data at the source. Different combinations of these expansions arise in modern applications such as scientific computing on data-grids and middle-tier caching in web-based databases. We present a randomized online (2α + 2)-competitive algorithm for this problem, given any a-competitive algorithm for the well studied object caching (multi-size paging) problem. This is the first known online algorithm for the combined problem and for several simpler combinations of the three extensions. This algorithm is both space-efficient and computationally tractable and has bounded overhead for control communication. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Little, P., & Chaudhary, A. (2009). Object caching for queries and updates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5431 LNCS, pp. 394–405). https://doi.org/10.1007/978-3-642-00202-1_34
Mendeley helps you to discover research relevant for your work.