Results 1 
2 of
2
The LRUK Page Replacement Algorithm For Database Disk Buffering
, 1993
"... This paper introduces a new approach to database disk buffering, called the LRUK method. The basic idea of LRUK is to keep track of the times of the last K references to popular database pages, using this information to statistically estimate the interarrival time of such references on a page by ..."
Abstract

Cited by 274 (3 self)
 Add to MetaCart
This paper introduces a new approach to database disk buffering, called the LRUK method. The basic idea of LRUK is to keep track of the times of the last K references to popular database pages, using this information to statistically estimate the interarrival time of such references on a page by page basis. Although the LRUK approach performs optimal statistical inference under relatively standard assumptions, it is fairly simple and incurs little bookkeeping overhead. As we demonstrate with simulation experiments, the LRUK algorithm surpasses conventional buffering algorithms in discriminating between frequently and infrequently referenced pages. In fact, LRUK can approach the behavior of buffering algorithms in which page sets with known access frequencies are manually assigned to different buffer pools of specifically tuned sizes. Unlike such customized buffering algorithms however, the LRUK method is selftuning, in the sense that it does not rely on external hints abo...
The LRUK Page Replacement Algorithm For Database Disk Buffering
 In Proc. ACM SIGMOD International Conference on Management of Data, Washingtion, D.C
, 1993
"... This paper introduces a new approach to database disk buffering, called the LRUK method. The basic idea of LRUK is to keep track of the times of the last K references to popular database pages, using this information to statistically estimate the interarrival times of references on a page by page ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper introduces a new approach to database disk buffering, called the LRUK method. The basic idea of LRUK is to keep track of the times of the last K references to popular database pages, using this information to statistically estimate the interarrival times of references on a page by page basis. Although the LRUK approach performs optimal statistical inference under relatively standard assumptions, it is fairly simple and incurs little bookkeeping overhead. As we demonstrate with simulation experiments, the LRUK algorithm surpasses conventional buffering algorithms in discriminating between frequently and infrequently referenced pages. In fact, LRUK can approach the behavior of buffering algorithms in which page sets with known access frequencies are manually assigned to different buffer pools of specifically tuned sizes. Unlike such customized buffering algorithms however, the LRUK method is selftuning, and does not rely on external hints about workload characteristics. Furthermore, the LRUK algorithm adapts in real time to changing patterns of access.