Database buffer paging in virtual storage systems

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.

REFERENCES

• 1: ~ERN~NDEZ, E.B., LAN~, T., AND WOOD, C. The effect of main memory replacement algorithrns on the performance of a paged buffer system. Submitted for publication.
• 2: RODRIOt~Ez-R0sEI, L, J. Empirical data reference behavior in data base systems. Computer 9, 11 (Nov. 1976), 9-13.
• 3: Stephen W. Sherman , Richard S. Brice, Performance of a database manager in a virtual memory system, ACM Transactions on Database Systems (TODS), v.1 n.4, p.317-343, Dec. 1976 [doi>10.1145/320493.320494]
• 4: T~EL, W.G. JR. An analysis of buffer paging in virtual storage systems. IB~ J. Res. and Develop. 20, 5 (Sept. 1976), 518-520.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT

General Terms:
Algorithms, Design, Management, Performance

Keywords:
buffer management, computer systems performance, database performance, page replacement algorithm, virtual memory