Buffer management in relational database systems

The hot-set model, characterizing the buffer requirements of relational queries, is presented. This model allows the system to determine the optimal buffer space to be allocated to a query; it can also be used by the query optimizer to derive efficient execution plans accounting for the available buffer space, and by a query scheduler to prevent thrashing. The hot-set model is compared with the working-set model. A simulation study is presented.

[1]  Stavros Christodoulakis,et al.  Implications of certain assumptions in database performance evauation , 1984, TODS.

[2]  David J. DeWitt,et al.  A methodology for database system performance evaluation , 1984, SIGMOD '84.

[3]  Yogen K. Dalal,et al.  Pilot: an operating system for a personal computer , 1980, CACM.

[4]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.

[5]  Irving L. Traiger,et al.  System R: relational approach to database management , 1976, TODS.

[6]  Peter J. Denning,et al.  The working set model for program behavior , 1968, CACM.

[7]  Tomás Lang,et al.  Effect of Replacement Algorithms on a Paged Buffer Database System , 1978, IBM J. Res. Dev..

[8]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[9]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[10]  S. B. Yao,et al.  Approximating block accesses in database organizations , 1977, CACM.

[11]  Mohamed Z. Ghanem,et al.  Dynamic Partitioning of the Main Memory Using the Working Set Concept , 1975, IBM J. Res. Dev..

[12]  Won Kim,et al.  A new way to compute the product and join of relations , 1980, SIGMOD '80.

[13]  Giovanni Maria Sacco,et al.  A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model , 1982, VLDB.

[14]  Donald D. Chamberlin,et al.  SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control , 1976, IBM J. Res. Dev..

[15]  W. S. Luk.  On estimating block accesses in database organizations , 1983, CACM.

[16]  Michael Stonebraker,et al.  Operating system support for database management , 1981, CACM.

[17]  Rudolf Bayer,et al.  Database System Design for High Performance , 1983, IFIP Congress.

[18]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[19]  Eugene Wong,et al.  Query processing in a system for distributed databases (SDD-1) , 1981, TODS.

[20]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[21]  Gio Wiederhold,et al.  Estimating block accesses in database organizations: a closed noniterative formula , 1983, CACM.

[22]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[23]  Mary E. S. Loomis,et al.  Logical, internal, and physical reference behavior in CODASYL database systems , 1984, TODS.

[24]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[25]  Giovanni Maria Sacco.  Fragmentation: a technique for efficient query processing , 1986, TODS.

[26]  Tomás Lang,et al.  Database buffer paging in virtual storage systems , 1977, TODS.

[27]  Michael Stonebraker,et al.  The design and implementation of INGRES , 1976, TODS.

[28]  Wolfgang Effelsberg,et al.  Principles of database buffer management , 1984, TODS.

[29]  Raymond A. Lorie,et al.  Physical integrity in a large segmented database , 1977, TODS.

[30]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[31]  G. M. Sacco,et al.  A technique for managing the buffer pool in a relational system using the hot set model , 1982, VLDB 1982.

[32]  Irving L. Traiger,et al.  Evaluation Techniques for Storage Hierarchies , 1970, IBM Syst. J..

[33]  M. W. Blasgen,et al.  Storage and Access in Relational Data Bases , 1977, IBM Syst. J..