Making the most of cache groups

  • Authors:
  • Andreas Bühmann;Theo Härder

  • Affiliations:
  • Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany;Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany

  • Venue:
  • DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.