By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Keller, A.M. ; Dept. of Comput. Sci., Stanford Univ., Palo Alto, CA, USA ; Basu, J.

We propose a new client-side data caching scheme for relational databases with a central server and multiple clients. Data is loaded into a client cache based on queries, which are used to form predicates describing 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'. On the other hand, `cache currency deals with the effect of updates at the central database on the client caches. We examine various performance and optimization issues involved in addressing the questions of cache currency and completeness using predicate descriptions. Expected benefits of our approach over commonly used object 1D-based caching include lower query response times, reduced message traffic, higher server throughput, and better scalability

Published in:

Parallel and Distributed Information Systems, 1994., Proceedings of the Third International Conference on

Date of Conference:

28-30 Sep 1994