Skip to main content
Springer Nature Link
Log in

Object Caching for Queries and Updates

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5431))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cao, P., Irani, S.: Cost-aware www proxy caching algorithms. In: Proceedings of the USENIX Symposium on Internet Technologies and Systems, Berkeley, CA, USA, USENIX Association, p. 18 (1997)

    Google Scholar 

  2. Irani, S.: Page replacement with multi-size pages and applications to web caching. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 701–710. ACM, New York (1997)

    Google Scholar 

  3. Young, N.E.: Online file caching. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 82–86. Society for Industrial and Applied Mathematics (1998)

    Google Scholar 

  4. Otoo, E., Rotem, D., Shoshani, A.: Impact of admission and cache replacement policies on response times of jobs on data grids. Cluster Computing 8, 293–303 (2005)

    Article  Google Scholar 

  5. Otoo, E., Rotem, D., Romosan, A.: Optimal file-bundle caching algorithms for data-grids. In: Proceedings of the 2004 ACM/IEEE conference on Supercomputing, p. 6. IEEE Computer Society Press, Washington (2004)

    Google Scholar 

  6. Luo, Q., Krishnamurthy, S., Mohan, C., Pirahesh, H., Woo, H., Lindsay, B.G., Naughton, J.F.: Middle-tier database caching for e-business. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 600–611. ACM, New York (2002)

    Google Scholar 

  7. Malik, T., Burns, R., Chaudhary, A.: Bypass caching: Making scientific databases good network citizens. In: Proceedings of the International Conference on Data Engineering, pp. 94–105. IEEE Computer Society Press, Washington (2005)

    Google Scholar 

  8. Bagchi, A., Chaudhary, A., Goodrich, M.T., Li, C., Shmueli-Scheuer, M.: Achieving communication efficiency through push-pull partitioning of semantic spaces to disseminate dynamic information. IEEE Transactions on Knowledge and Data Engineering 18(10), 1352–1367 (2006)

    Article  Google Scholar 

  9. Olston, C., Loo, B.T., Widom, J.: Adaptive precision setting for cached approximate values. ACM SIGMOD Record 30, 355–366 (2001)

    Article  Google Scholar 

  10. Olston, C., Widom, J.: Best-effort cache synchronization with source cooperation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 73–84. ACM, New York (2002)

    Google Scholar 

  11. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)

    MATH  Google Scholar 

  12. Little, P.: Online algorithms for dynamic data and query shipping in object caching. Master’s thesis, University of Notre Dame (2008)

    Google Scholar 

  13. McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica 6, 816–825 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hochbaum, D.: Approximation Algorithms for NP-hard Problems. PWS Publishing Company (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, University of Notre Dame, USA

    Philip Little & Amitabh Chaudhary

Authors
  1. Philip Little
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amitabh Chaudhary
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, 700 108, Kolkata, India

    Sandip Das

  2. Japan Advanced Institute of Science and Technology, 923-1292, Ishikawa, Japan

    Ryuhei Uehara

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Little, P., Chaudhary, A. (2009). Object Caching for Queries and Updates. In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00202-1_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00201-4

  • Online ISBN: 978-3-642-00202-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics