|
|
|
Making the Most of Cache Groups
Andreas Bühmann and Theo Härder
Department of Computer Science
University of Kaiserslautern
P.O. Box 3049, D-67653 Kaiserslautern, Germany
E-mail: {buehmann, haerder}@informatik.uni-kl.de
Abstract
Cache groups are a powerful concept for database caching, which is
used to relieve the backend database load and to keep referenced data close to
the application programs at the “edge of the Web”. Such cache groups consist of
cache tables containing a subset of the backend database’s data, guided by cache
constraints. If certain query types are anticipated in the application workload,
specifically designed cache groups can directly process parts of incoming declarative queries. The main class of such queries, project-select-join queries, can be
supported by specifying a proper set of referential cache constraints.
Cache groups should be managed in the most cost-effective way. Hence, redundant
constraints should not be respected during cache loading and consistency
maintenance to avoid unnecessary overhead. On the other hand, because as much
queries as possible should be processable in the cache, all redundant relationships
implied by the set of specified cache constraints should be made explicit to help
the query optimizer.
Proc. DASFAA 2007, Bangkok; LNCS 4443, pp. 349-360, Springer, April 2007.
|
