Object Caching for Queries and Updates

Authors:
Philip Little;Amitabh Chaudhary
Affiliations:
Department of Computer Science & Engineering, University of Notre Dame,;Department of Computer Science & Engineering, University of Notre Dame,
Venue:
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Year:
2009

Citing 12
Cited 0

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Page replacement with multi-size pages and applications to Web caching

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis

Online computation and competitive analysis
On-line file caching

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Adaptive precision setting for cached approximate values

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Best-effort cache synchronization with source cooperation

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Middle-tier database caching for e-business

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Optimal File-Bundle Caching Algorithms for Data-Grids

Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Bypass Caching: Making Scientific Databases Good Network Citizens

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Impact of Admission and Cache Replacement Policies on Response Times of Jobs on Data Grids

Cluster Computing
Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information

IEEE Transactions on Knowledge and Data Engineering
Cost-aware WWW proxy caching algorithms

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.