Name
Abstract | ||
|---|---|---|
DB2 Universal Database (DB2/UDB) divides the buffer area into a number of independent buffer pools and each database object (table or index) is assigned to a specific buffer pool. Buffer pool sizing, which sets an appropriate size for each of the buffer pools is crucial for achieving optimal performance.In this paper, we investigate the buffer pool sizing problem. Two cost models, which are based on page fault and data access time, are examined. A greedy algorithm is proposed to search for the optimal solution. We study the effectiveness of the above techniques using experiments with the TPC-C benchmark database. The results show that the data access time based cost model is more effective for optimizing the buffer pool sizes than the page fault based cost model. |
Year | Venue | Keywords |
|---|---|---|
2003 | CASCON | buffer pool,buffer pool size,independent buffer pool,multiple buffer pool,specific buffer pool,cost model,buffer area,data access time,buffer pool sizing,db2 universal database,page fault,indexation,greedy algorithm,data access |
Field | DocType | Citations |
Computer science,Greedy algorithm,Sizing,Page fault,Data access,Distributed computing | Conference | 11 |
PageRank | References | Authors |
0.80 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenhu Tian | 1 | 22 | 2.42 |
| Pat Martin | 2 | 80 | 5.64 |
| Wendy Powley | 3 | 329 | 28.43 |