Prefetching—a performance analysis

https://doi.org/10.1016/0306-4379(90)90047-SGet rights and content

Abstract

Reduction of page faults and thus, response times, is one of the keys to overall improvement of database access behavior. Assuming a transaction load of predominantly schematic or canned transactions, exploitation of preknowledge of transaction access patterns leads to the concept of prefetching, i.e. loading data pages into the system buffer in advance and before a time-critical access request is issued. Thus, the time behavior of a main memory database can be achieved. The justification of prefetching is only given by satisfying the time restriction in real-time application. This paper presents the concept and an experimental validation clearly identifying potential gains.

References (10)

  • L.A. Belady

    A study of replacement algorithms for virtual storage computers

    IBM Systems Jl

    (1966)
  • H. Wedekind et al.

    Prefetching in realtime database applications

  • W. Effelsberg et al.

    Principles of database buffer management

    ACM TODS

    (1984)
  • A.J. Smith

    Sequentiality and prefetching

    ACM TODS

    (1978)
  • J. Rodriguez-Rosell

    Empirical data reference in database systems

    Computer

    (1976)
There are more references available in the full text version of this article.

Cited by (0)

View full text