Techniques for automatically sizing multiple buffer pools in DB2

  • Authors:
  • Wenhu Tian;Pat Martin;Wendy Powley

  • Affiliations:
  • School of Computing, Queen's University, Kingston, Ontario, Canada, K7L 3N6;School of Computing, Queen's University, Kingston, Ontario, Canada, K7L 3N6;School of Computing, Queen's University, Kingston, Ontario, Canada, K7L 3N6

  • Venue:
  • CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

DB2 Universal Database (DB2/UDB) divides the buffer area into a number of independent buffer pools and each database object (table or index) is assigned to a specific buffer pool. Buffer pool sizing, which sets an appropriate size for each of the buffer pools is crucial for achieving optimal performance.In this paper, we investigate the buffer pool sizing problem. Two cost models, which are based on page fault and data access time, are examined. A greedy algorithm is proposed to search for the optimal solution. We study the effectiveness of the above techniques using experiments with the TPC-C benchmark database. The results show that the data access time based cost model is more effective for optimizing the buffer pool sizes than the page fault based cost model.