Reference Hub20
Experimental Study of a Self-Tuning Algorithm for DBMS Buffer Pools

Experimental Study of a Self-Tuning Algorithm for DBMS Buffer Pools

Patrick Martin, Wendy Powley, Min Zheng, Keri Romanufa
Copyright: © 2005 |Volume: 16 |Issue: 2 |Pages: 20
ISSN: 1063-8016|EISSN: 1533-8010|ISSN: 1063-8016|EISBN13: 9781615200542|EISSN: 1533-8010|DOI: 10.4018/jdm.2005040101
Cite Article Cite Article

MLA

Martin, Patrick, et al. "Experimental Study of a Self-Tuning Algorithm for DBMS Buffer Pools." JDM vol.16, no.2 2005: pp.1-20. http://doi.org/10.4018/jdm.2005040101

APA

Martin, P., Powley, W., Zheng, M., & Romanufa, K. (2005). Experimental Study of a Self-Tuning Algorithm for DBMS Buffer Pools. Journal of Database Management (JDM), 16(2), 1-20. http://doi.org/10.4018/jdm.2005040101

Chicago

Martin, Patrick, et al. "Experimental Study of a Self-Tuning Algorithm for DBMS Buffer Pools," Journal of Database Management (JDM) 16, no.2: 1-20. http://doi.org/10.4018/jdm.2005040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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 increasing diversity of the data and the workloads handled by today’s systems is making manual tuning by database administrators almost impossible. Self-tuning DBMSs, which dynamically reallocate resources in response to changes in their workload in order to maintain predefined levels of performance, are one approach to handling the tuning problem. In this paper, we apply self-tuning technology to managing the buffer pools, which are a key resource in a DBMS. Tuning the size of the buffer pools to a workload is crucial to achieving good performance. We describe a Buffer Pool Tuning Wizard that can be used by database administrators to determine effective buffer pool sizes. The wizard is based on a self-tuning algorithm called the Dynamic Reconfiguration algorithm (DRF), which uses the principle of goal-oriented resource management. It is an iterative algorithm that uses greedy heuristics to find a reallocation that benefits a target transaction class. We define and motivate the cost estimate equations used in the algorithm. We present the results of a set of experiments to investigate the performance of the algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.