An evaluation of buffer management strategies for relational database systems

  • Authors:
  • Hong-Tai Chou;David J. DeWitt

  • Affiliations:
  • -;-

  • Venue:
  • VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a new algorithm, DBMIN, for managing the buffer pool of a relational database manaegememt system. DBMIN is based on a new model of relational query behavior, the query locality set model (QLSM). Like the hot set model, the QLSM has an advantage over the stochastic models due to its ability to predict future reference hehavior. However, the QLSM avoids the potential problems of the hot set model by separating the modeling of referr-ence bahavior from any particular buffer management algorithm. After introducing the QLSM and describing the DBMIN algorithm, we present a performance evaluation methodology for evaluating buffer manage-ment algorithms in a multiuser environment. This methodology employed a hybrid model that comhines features of both trace driven and distribution driven simulation models. Using this model the performance of the DBMIN algorithm in a multiuser environment is compared with that of the hot set algorithm and four more traditional buffer replacement algorithms.