The tasks of configuring and tuning large database management systems (DBMSs) have always been both complex and time-consuming. They require knowledge of the characteristics of the system, the data, and the workload, and of the interrelationships between them. The buffer pools, because they exist to reduce the number of disk accesses performed by a transaction, are a key resource in a DBMS. Current DBMSs, such as DB2 Universal Database, divide the buffer area into a number of independent buffer pools and database objects (tables and indices) are assigned to a specific buffer pool. The size of each buffer pool is set by configuration parameters and page replacement is local to each buffer pool. Tuning the size of the buffer pools to a workload is crucial to achieving good performance. In this paper we describe a self-tuning algorithm, called the Dynamic Reconfiguration algorithm (DRF), for managing the buffer pools in a DBMS and we present the results of a set of experiments to investigate the performance of an implementation of the algorithm for DB2 Universal Database.
CITATION STYLE
Martin, P., Li, H. Y., Zheng, M., Romanufa, K., & Powley, W. (2000). Dynamic reconfiguration algorithm: Dynamically tuning multiple buffer pools. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1873, pp. 92–101). Springer Verlag. https://doi.org/10.1007/3-540-44469-6_9
Mendeley helps you to discover research relevant for your work.