In this paper, we propose the concept of using query execution feedback for improving database buffer management. A query feedback model which adaptively quantifies the page fault characteristics of all query access patterns including sequential, looping and most importantly random, is defined. Based on this model, a load control and a marginal gain ratio buffer allocation scheme are developed. Simulation experiments show that the proposed method is consistently better than the previous methods and in most cases, it significantly outperforms all other methods for random access reference patterns. (Also cross-referenced as UMIACS-TR-93-49
The query processor of a relational database system executes declarative queries on relational data ...
In recent years, several methods have been proposed for implementing interactive similarity queries ...
A methodology is presented for evaluating the performance of database update schemes. The methodolog...
We investigated a number of design and performance issues of interoperable database management syste...
Current database systems employ static heuristics for estimating the access time of a particular que...
The overall performance of a database system is very sensitive to the buffer replacement algorithm u...
We give formulas for estimating the number of disk accesses when accessing a file randomly with buff...
Query processing in databases can be divided into two steps: selecting an 'optimal' evaluation strat...
In this paper, we propose a novel approach for estimating the record selectivities of database queri...
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution...
Databases are very complex systems that require database system administrators to perform system tun...
The problem of database buffer management has extensively been studied for nearly three decades. In ...
The traditional page-grained buffer manager in database systems has a low hit ratio when only a few ...
Abstract: Buffer memory allocation is one of the most important, but also one of the most difficult ...
Fast retrieval of data has been a need of user in any database application. This paper introduces a ...
The query processor of a relational database system executes declarative queries on relational data ...
In recent years, several methods have been proposed for implementing interactive similarity queries ...
A methodology is presented for evaluating the performance of database update schemes. The methodolog...
We investigated a number of design and performance issues of interoperable database management syste...
Current database systems employ static heuristics for estimating the access time of a particular que...
The overall performance of a database system is very sensitive to the buffer replacement algorithm u...
We give formulas for estimating the number of disk accesses when accessing a file randomly with buff...
Query processing in databases can be divided into two steps: selecting an 'optimal' evaluation strat...
In this paper, we propose a novel approach for estimating the record selectivities of database queri...
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution...
Databases are very complex systems that require database system administrators to perform system tun...
The problem of database buffer management has extensively been studied for nearly three decades. In ...
The traditional page-grained buffer manager in database systems has a low hit ratio when only a few ...
Abstract: Buffer memory allocation is one of the most important, but also one of the most difficult ...
Fast retrieval of data has been a need of user in any database application. This paper introduces a ...
The query processor of a relational database system executes declarative queries on relational data ...
In recent years, several methods have been proposed for implementing interactive similarity queries ...
A methodology is presented for evaluating the performance of database update schemes. The methodolog...