A predicate-based caching scheme for client-server database architectures

  • Authors:

  • Arthur M. Keller;Julie Basu

  • Affiliations:

  • Stanford University, Computer Science Department, Gates Bulding 2A, Stanford, CA 94305-9020, USA;Stanford University, Computer Science Department, Stanford, CA 94 305-9020, USA and Oracle Corporation, 500 Oracle Parkway, Box 659413, Redwood Shores, CA 94065, USA

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a new client-side data-caching scheme for relational databases with a central server and multiple clients. Data are loaded into each client cache based on queries executed on the central database at the server. These queries are used to form predicates that describe the cache contents. A subsequent query at the client may be satisfied in its local cache if we can determine that the query result is entirely contained in the cache. This issue is called cache completeness. A separate issue, cache currency, deals with the effect on client caches of updates committed at the central database. We examine the various performance tradeoffs and optimization issues involved in addressing the questions of cache currency and completeness using predicate descriptions and suggest solutions that promote good dynamic behavior. Lower query-response times, reduced message traffic, higher server throughput, and better scalability are some of the expected benefits of our approach over commonly used relational server-side and object ID-based or page-based client-side caching.