The hot-set model, characterizing the buffer requirements of relational queries, is presented. This model allows the system to determine the optimal buffer space to be allocated to a query; it can also be used by the query optimizer to derive efficient execution plans accounting for the available buffer space, and by a query scheduler to prevent thrashing. The hot-set model is compared with the working-set model. A simulation study is presented
Abstract: Buffer memory allocation is one of the most important, but also one of the most difficult ...
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution...
The traditional page-grained buffer manager in database systems has a low hit ratio when only a few ...
We give formulas for estimating the number of disk accesses when accessing a file randomly with buff...
. In this paper we present two improvements to the partitioning process: 1) A new dynamic buffer man...
Due to the character of the original source materials and the nature of batch digitization, quality ...
The problem of database buffer management has extensively been studied for nearly three decades. In ...
Real-Time, active database systems (RTADBs) have attracted the attention of researchers in recent ti...
This paper discusses the implementation of a database buffer manager as a component of a DBMS. The i...
With the advent of 64-bit processors, large main memories are set to become very common. This in tur...
AbstractÐPast R-tree studies have focused on the number of nodes visited as a metric of query perfor...
Fast retrieval of data has been a need of user in any database application. This paper introduces a ...
An autonomic database management system is a self tuning, self optimizing, self healing and self pro...
Nowadays, database optimizers take advantage of indexes and materialized views (MVs) to produce quer...
98 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.Past approaches to fine-granul...
Abstract: Buffer memory allocation is one of the most important, but also one of the most difficult ...
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution...
The traditional page-grained buffer manager in database systems has a low hit ratio when only a few ...
We give formulas for estimating the number of disk accesses when accessing a file randomly with buff...
. In this paper we present two improvements to the partitioning process: 1) A new dynamic buffer man...
Due to the character of the original source materials and the nature of batch digitization, quality ...
The problem of database buffer management has extensively been studied for nearly three decades. In ...
Real-Time, active database systems (RTADBs) have attracted the attention of researchers in recent ti...
This paper discusses the implementation of a database buffer manager as a component of a DBMS. The i...
With the advent of 64-bit processors, large main memories are set to become very common. This in tur...
AbstractÐPast R-tree studies have focused on the number of nodes visited as a metric of query perfor...
Fast retrieval of data has been a need of user in any database application. This paper introduces a ...
An autonomic database management system is a self tuning, self optimizing, self healing and self pro...
Nowadays, database optimizers take advantage of indexes and materialized views (MVs) to produce quer...
98 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.Past approaches to fine-granul...
Abstract: Buffer memory allocation is one of the most important, but also one of the most difficult ...
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution...
The traditional page-grained buffer manager in database systems has a low hit ratio when only a few ...