The LRU-K Page Replacement Algorithm For Database Disk Buffering

DMCA

The LRU-K Page Replacement Algorithm For Database Disk Buffering (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Elizabeth J. O'Neil , Patrick E. O'Neil , Gerhard Weikum

Citations:

329 - 3 self

BibTeX

@INPROCEEDINGS{O'Neil93thelru-k,
    author = {Elizabeth J. O'Neil and Patrick E. O'Neil and Gerhard Weikum},
    title = {The LRU-K Page Replacement Algorithm For Database Disk Buffering},
    booktitle = {},
    year = {1993},
    pages = {297--306},
    publisher = {}
}

OpenURL

Abstract

This paper introduces a new approach to database disk buffering, called the LRU-K method. The basic idea of LRU-K 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 LRU--K 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 LRU-K algorithm surpasses conventional buffering algorithms in discriminating between frequently and infrequently referenced pages. In fact, LRU-K 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 LRU-K method is self--tuning, in the sense that it does not rely on external hints abo...

Keyphrases

database disk buffering lru-k page replacement algorithm lru method last reference page set page basis lru algorithm disk buffering known access frequency new approach basic idea different buffer pool external hint popular database page simulation experiment customized buffering algorithm interarrival time standard assumption

DMCA