Principles of database buffer management
ACM Transactions on Database Systems (TODS)
Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
Integration of buffer management and query optimization in relational database environment
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Flexible buffer allocation based on marginal gains
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Performance of a database manager in a virtual memory system
ACM Transactions on Database Systems (TODS)
Database buffer paging in virtual storage systems
ACM Transactions on Database Systems (TODS)
Approximating block accesses in database organizations
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Predictive Load Control for Flexible Buffer Allocation
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
A database disk buffer management algorithm based on prefetching
Proceedings of the seventh international conference on Information and knowledge management
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Transactions on Computers
IEEE Transactions on Computers
WATCHMAN: A Data Warehouse Intelligent Cache Manager
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Simulating DB2 buffer pool management
CASCON '00 Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research
Analysis of Distributed Database Access Histories for Buffer Allocation
WISE '00 Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 2 - Volume 2
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Program-counter-based pattern classification in buffer caching
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Model-based resource provisioning in a web service utility
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
An implementation study of a detection-based adaptive block replacement scheme
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
A new approach to dynamic self-tuning of database buffers
ACM Transactions on Storage (TOS)
Adaptive disk scheduling with workload-dependent anticipation intervals
Journal of Systems and Software
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Low-overhead decision support for dynamic buffer reallocation
Computer Science - Research and Development
Hi-index | 14.99 |
The problem of buffer management in database management systems is concerned with the efficient main memory allocation and management for answering database queries. Previous works on buffer allocation are based either exclusively on the availability of buffers at runtime or on the access patterns of queries. In this paper, we first propose a unified approach for buffer allocation in which both of these considerations are taken into account. Our approach is based on the notion of marginal gains which specify the expected reduction in page faults by allocating extra buffers to a query. Then, we extend this approach to support adaptable buffer allocation. An adaptable buffer allocation algorithm automatically optimizes itself for the specific query workload. To achieve this adaptability, we propose using run-time information, such as the load of the system, in buffer allocation decisions. Our approach is to use a simple queuing model to predict whether a buffer allocation will improve the performance of the system. Thus, this paper provides a more theoretical basis for buffer allocation. Simulation results show that our methods based on marginal gains and our predictive methods consistently outperform existing allocation strategies. In addition, the predictive methods have the added advantage of adjusting their allocation to changing workloads.