Buffer management in relational database systems
ACM Transactions on Database Systems (TODS)
Buffer management algorithms for relational database management systems
Information and Software Technology
Database research: achievements and opportunities into the 1st century
ACM SIGMOD Record
Parallel Processing; The Transputer and Its Applications
Parallel Processing; The Transputer and Its Applications
Index Access with a Finite Buffer
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An evaluation of buffer management strategies for relational database systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
| Hi-index | 0.00 |
This paper presents the development of a buffer algorithm named RESBAL, which exploits parallelism in order to offer high performance for query execution in relational database systems. The algorithm aims to provide both efficient and predictive data buffering by exploiting the use of prior knowledge of query reference behaviour. Designed to offer a high level of flexibility, RESBAL employs a multiple buffering strategy both on page fetch level and page replacement level. The evaluation of RESBAL has been carried out in a parallel database system environment based on a transputer architecture. The results of this evaluation allow comparisons to be made between different buffer algorithms, and demonstrate the feasibility and effectiveness of the RESBAL algorithm. It is hoped that this work will provide some useful input to research on developing high performance database systems. Their new uses such as data mining and data warehousing are presenting the research community with interesting and important challenges.