Object Caching for Queries and Updates

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 α-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.

[1]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[2]  Neal E. Young,et al.  On-Line File Caching , 2002, SODA '98.

[3]  Chun Zhang,et al.  Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[4]  Randal C. Burns,et al.  Bypass caching: making scientific databases good network citizens , 2005, 21st International Conference on Data Engineering (ICDE'05).

[5]  Philip Damien Little.  Online Algorithms for Dynamic Data and Query Shipping in Object Caching , 2008 .

[6]  Michael T. Goodrich,et al.  Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information , 2006, IEEE Transactions on Knowledge and Data Engineering.

[7]  Doron Rotem,et al.  Optimal File-Bundle Caching Algorithms for Data-Grids , 2004, Proceedings of the ACM/IEEE SC2004 Conference.

[8]  Jeffrey F. Naughton,et al.  Middle-tier database caching for e-business , 2002, SIGMOD '02.

[9]  Jennifer Widom,et al.  Best-effort cache synchronization with source cooperation , 2002, SIGMOD '02.

[10]  Jeff Huskamp.  Proceedings of the 2004 ACM/IEEE conference on Supercomputing , 2004 .

[11]  Lyle A. McGeoch,et al.  A strongly competitive randomized paging algorithm , 1991, Algorithmica.

[12]  Sandy Irani,et al.  Page replacement with multi-size pages and applications to Web caching , 1997, STOC '97.

[13]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[14]  Jennifer Widom,et al.  Adaptive precision setting for cached approximate values , 2001, SIGMOD '01.

[15]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[16]  Arie Shoshani,et al.  Impact of Admission and Cache Replacement Policies on Response Times of Jobs on Data Grids , 2005, Cluster Computing.

[17]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .