Database buffer paging in virtual storage systems

  • Authors:
  • Tomás Lang;Christopher Wood;Eduardo B. Fernández

  • Affiliations:
  • Univ. of California, Los Angeles;IBM Corp., Los Angeles, CA;IBM Corp., Los Angeles, CA

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 1977

Quantified Score

Hi-index 0.01

Visualization

Abstract

Three models, corresponding to different sets of assumptions, are analyzed to study the behavior of a database buffer in a paging environment. The models correspond to practical situations and vary in their search strategies and replacement algorithms. The variation of I/O cost with respect to buffer size is determined for the three models. The analysis is valid for arbitrary database and buffer sizes, and the I/O cost is obtained in terms of the miss ratio, the buffer size, the number of main memory pages available for the buffer, and the relative buffer and database access costs.