research-article

An evaluation of buffer management strategies for relational database systems

Authors:

Hong -Tai Chou,

David J. DeWittAuthors Info & Claims

Algorithmica, Volume 1, Issue 1-4

Pages 311 - 336

https://doi.org/10.1007/BF01840450

Published: 22 March 2023 Publication History

Abstract

In this paper we present a new algorithm, DBMIN, for managing the buffer pool of a relational database management system. DBMIN is based on a new model of relational query behavior, thequery 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 behavior. However, the QLSM avoids the potential problems of the hot set model by separating the modeling of reference behavior from any particular buffer management algorithm. After introducing the QLSM and describing the DBMIN algorithm, we present a performance evaluation methodology for evaluating buffer management algorithms in a multiuser environment. This methodology employed a hybrid model that combines 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.

References

[1]

M. M. Astrahanet. al., System R: a relational approach to database management,ACM Trans. Database Systems,1 (1976).

[2]

D. Bitton, D. J. DeWitt, and C. Turbyfill, Benchmarking database systems: a systematic approach,Proceedings of the Ninth International Conference on Very Large Data Bases, 1983.

[3]

Blasgen M. W. and Eswaran K. P. Storage and access in relational data base IBM Systems J. 1977 4 363-377

[4]

H. Boral and D. J. DeWitt, A methodology for database system performance evaluation,Proceedings of the International Conference on Management of Data, Boston, MA, 1984, pp. 176–185.

[5]

Chou Hong-Tai, DeWitt D. J., Katz R. H., and Klug A. C. Design and implementation of the Wisconsin storage system 1983 Madison Department of Computer Sciences, University of Wisconsin

[6]

Chou Hong-Tai Buffer management in database systems Ph.D. Thesis 1985 Madison University of Wisconsin

[7]

DeWitt D. J., Finkel R., and Solomon M. The CRYSTAL multicomputer: design and implementation experience 1984 Madison Department of Computer Sciences, University of Wisconsin

[8]

Denning P. J. The working set model for program behavior Comm. ACM 1968 11 323-333

[9]

Denning P. J., Kahn K. C., Leroudier J., Potier D., and Suri R. Optimal multiprogramming Acta Inform. 1976 7 197-216

[10]

Denning P. J. Yeh R. T. Optimal multiprogrammed memory management Current Trends in Programming Methodology, vol. III 1978 Englewood Cliffs, NJ Prentice-Hall 298-322

[11]

Effelsberg W. and Haerder T. Principles of database buffer management ACM Trans. Database Systems 1984 9 560-595

[12]

Fernandez E. B., Lang T., and Wood C. Effect of replacement algorithms on a paged buffer database system IBM J. Res. Develop. 1978 22 185-196

[13]

M. H. Fogel, The VMOS paging algorithm, a practical implementation of the working set model,ACM Operating System Rev. 8 (1974).

[14]

Fujitsu Limited,M2351A/AF Mini-Disk Drive CE Manual, 1982.

[15]

Gelenbe E. A unified approach to the evaluation of a class of replacement algorithms IEEE Trans. Comput. 1973 22 611-618

[16]

Kaplan J. A. Buffer management policies in a database environment 1980 Berkeley University of California

[17]

W. F. King, III, Analysis of demand paging algorithms,Proceedings of the IFIP Congress (Information Processing 71), North Holland, Amsterdam, 1971, pp. 485–490.

[18]

T.' Lang, C. Wood, and I. B. Fernandez, Database buffer paging in virtual storage systems,ACM Trans. Database Systems, 2 (1977).

[19]

J. Leroudier and D. Potier, Principles of optimality for multi-programming,Proceedings of the International Symposium on Computer Performance Modeling, Measurement, and Evaluation, ACM SIGMETRICS (IFIP WG. 7.3), Cambridge, 1976, pp. 211–218.

[20]

Nyberg C. Disk scheduling and cache replacement for a database machine 1984 Berkeley University of California

[21]

H. Opderbeck and W. W. Chu, Performance of the page fault frequency replacement algorithm in a multiprogramming environment,Proceedings of the IFIP Congress (Information Processing 74), North Holland, Amsterdam, 1974, pp. 235–241.

[22]

Reiter A. A study of buffer management policies for data management systems 1976 Madison Mathematics Research Center, University of Wisconsin

[23]

G. M. Sacco and M. Schkolnick, A mechanism for managing the buffer pool in a relational database system using the hot set model,Proceedings of the Eighth International Conference on Very Large Data Bases, Mexico City, 1982, pp. 257–262.

[24]

G. M. Sacco and M. Schkolnick, Buffer management in relational database systems,ACM Trans. Database Systems (to appear).

[25]

R. G. Sargent, Statistical analysis of simulation output data,Proceedings of the ACM Symposium on Simulation of Computer Systems, 1976.

[26]

S.W. Sherman and J. C. Browne, Trace driven modeling: review and overview,Proceedings of the ACM Symposium on Simulation of Computer Systems, 1973, pp. 201–207.

[27]

S. W. Sherman and R. S. Brice, I/O buffer performance in a virtual memory system,Proceedings of the ACM Symposium on Simulation of Computer Systems, 1976, pp. 25–35.

[28]

S. W. Sherman and R. S. Brice, Performance of a database manager in a virtual memory system,ACM Trans. Database Systems, 1 (1976).

[29]

Stonebraker M., Wong M. E., and Kreps P. The design and implementation of INGRES ACM Trans. Database Systems 1976 1 189-222

[30]

Stonebraker M. Operating system support for database management Comm. ACM 1981 24 412-418

[31]

M. Stonebraker, J. Woodfill, J. Ranstrom, M. Murphy, M. Meyer, and E. Allman, Performance enhancements to a relational database system,TODS, 8 (1983).

[32]

Thorington J. M. Jr. and Irwin D. J. An adaptive replacement algorithm for paged memory computer systems IEEE Trans. Comput. 1972 21 1053-1061

[33]

Tuel W. G. Jr. An analysis of buffer paging in virtual storage systems IBM J. Res. Develop. 1976 20 518-520

[34]

Yao S. B. Approximating block accesses in database organizations Comm. ACM 1977 20 260-261

Cited By

Zhang ZLiu YPeng ZChen MXu DCui S(2024)Digital Twin-Assisted Data-Driven Optimization for Reliable Edge Caching in Wireless NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2024.343157542:11(3306-3320)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1109/JSAC.2024.3431575
Nicholson HChrysogelos PAilamaki A(2024)HPCache: memory-efficient OLAP through proportional caching revisitedThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00828-733:6(1775-1791)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1007/s00778-023-00828-7
Tian YZhang XDong YXu ZZhang MJiang YCheung SSun C(2023)On the Caching Schemes to Speed Up Program ReductionACM Transactions on Software Engineering and Methodology10.1145/361717233:1(1-30)Online publication date: 5-Sep-2023
https://dl.acm.org/doi/10.1145/3617172
Show More Cited By

Recommendations

An optimal lower bound for buffer management in multi-queue switches
SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms

In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input ports and one output port. This device forwards unit-size, unit-value ...
High-speed buffer management for 40 Gb/s-based photonic packet switches

We develop a method of high-speed buffer management for output-buffered photonic packet switches. The use of optical fiber delay lines is a promising solution to constructing optical buffers. The buffer manager determines packet delays in the fiber ...
Flash-Aware Buffer Management for Database Systems

Classical buffer replacement policies, e. g., LRU, are suboptimal for database systems having flash disks for persistence, because they are not aware of the distinguished characteristics of flash-based storage devices. The authors introduce the basic ...

Comments

Information & Contributors

Information

Published In

cover image Algorithmica

Algorithmica Volume 1, Issue 1-4

Nov 1986

517 pages

ISSN:0178-4617

Issue’s Table of Contents

© Springer-Verlag New York Inc. 1986.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 March 2023

Revision received: 07 July 1986

Received: 15 March 1986

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang ZLiu YPeng ZChen MXu DCui S(2024)Digital Twin-Assisted Data-Driven Optimization for Reliable Edge Caching in Wireless NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2024.343157542:11(3306-3320)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1109/JSAC.2024.3431575
Nicholson HChrysogelos PAilamaki A(2024)HPCache: memory-efficient OLAP through proportional caching revisitedThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00828-733:6(1775-1791)Online publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1007/s00778-023-00828-7
Tian YZhang XDong YXu ZZhang MJiang YCheung SSun C(2023)On the Caching Schemes to Speed Up Program ReductionACM Transactions on Software Engineering and Methodology10.1145/361717233:1(1-30)Online publication date: 5-Sep-2023
https://dl.acm.org/doi/10.1145/3617172
Zhao YLiu WDong FYang TLi YYang KLiu ZJia ZYang YSchulzrinne HKohler EMaltz DMisra V(2023)P4LRU: Towards An LRU Cache Entirely in Programmable Data PlaneProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3604813(967-980)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3604813
Nicholson HChrysogelos PAilamaki A(2022)HPCache: Memory-Efficient OLAP Through Proportional CachingProceedings of the 18th International Workshop on Data Management on New Hardware10.1145/3533737.3535100(1-9)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3533737.3535100
Pham MLi HYuan YMou CRamachandran KXu ZTu YRauchwerger LCameron KNikolopoulos DPnevmatikatos D(2022)Dynamic memory management in massively parallel systemsProceedings of the 36th ACM International Conference on Supercomputing10.1145/3524059.3532387(1-13)Online publication date: 28-Jun-2022
https://dl.acm.org/doi/10.1145/3524059.3532387
Chierichetti FKumar RVassilvitskii SParedaens JSu J(2009)Similarity cachingProceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1559795.1559815(127-136)Online publication date: 29-Jun-2009
https://dl.acm.org/doi/10.1145/1559795.1559815

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents