Sciweavers

VLDB
1990
ACM

Priority-Hints: An Algorithm for Priority-Based Buffer Management

13 years 7 months ago
Priority-Hints: An Algorithm for Priority-Based Buffer Management
- In this paper, we address the problem of buffer management in a DBMS when the workload consists of transactions of different priority levels. We present Priority-Hints. a new buffer management algorithm that uses hints provided by the DBMS access methods. The performance of Priority-Hints is compared to that of priority buffer management schemes introduced earlier for a variety of workloads. Our simulation results indicate that Priority-Hints performs consistently better than simple LRU-based algorithms. Furthermore, our algorithm approaches (and in some cases surpasses) the performance of highly sophisticated algorithms that require much more information to be provided to the buffer manager.
Rajiv Jauhari, Michael J. Carey, Miron Livny
Added 11 Aug 2010
Updated 11 Aug 2010
Type Conference
Year 1990
Where VLDB
Authors Rajiv Jauhari, Michael J. Carey, Miron Livny
Comments (0)