With the advent of 64-bit processors, large main memories are set to become very common. This in turn translates to larger buffer pool configurations in database servers. Query optimizers however, currently assume all data is disk resident while optimizing queries. This assumption will no longer be valid when buffer pools become 100’s of gigabytes in size. In this paper we examine how data presence in the buffer pool can affect the choice of query plans in an optimizer. We examine the possible benefits of buffer-pool aware query optimization and propose a generic architecture for implementing such an optimizer. 1
. In this paper we present two improvements to the partitioning process: 1) A new dynamic buffer man...
The query optimization phase within a database management system (DBMS) ostensibly finds the fastest...
The problem of database buffer management has extensively been studied for nearly three decades. In ...
Fast retrieval of data has been a need of user in any database application. This paper introduces a ...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.In the second part of this wo...
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution...
When a working set fits into memory, the overhead im-posed by the buffer pool renders traditional da...
As more and more query processing work can be done in main memory, memory access is becoming a signi...
In most database systems, the values of many impor-tant run-time parameters of the system, the data,...
Queries with common sequences of disk accesses can make maximal use of a buffer pool. We developed a...
An autonomic database management system is a self tuning, self optimizing, self healing and self pro...
Given a query, there are many access plans that a database management sys-tem (DBMS) can follow to p...
Abstract: Buffer memory allocation is one of the most important, but also one of the most difficult ...
The hot-set model, characterizing the buffer requirements of relational queries, is presented. This ...
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained in...
. In this paper we present two improvements to the partitioning process: 1) A new dynamic buffer man...
The query optimization phase within a database management system (DBMS) ostensibly finds the fastest...
The problem of database buffer management has extensively been studied for nearly three decades. In ...
Fast retrieval of data has been a need of user in any database application. This paper introduces a ...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.In the second part of this wo...
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution...
When a working set fits into memory, the overhead im-posed by the buffer pool renders traditional da...
As more and more query processing work can be done in main memory, memory access is becoming a signi...
In most database systems, the values of many impor-tant run-time parameters of the system, the data,...
Queries with common sequences of disk accesses can make maximal use of a buffer pool. We developed a...
An autonomic database management system is a self tuning, self optimizing, self healing and self pro...
Given a query, there are many access plans that a database management sys-tem (DBMS) can follow to p...
Abstract: Buffer memory allocation is one of the most important, but also one of the most difficult ...
The hot-set model, characterizing the buffer requirements of relational queries, is presented. This ...
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained in...
. In this paper we present two improvements to the partitioning process: 1) A new dynamic buffer man...
The query optimization phase within a database management system (DBMS) ostensibly finds the fastest...
The problem of database buffer management has extensively been studied for nearly three decades. In ...