Optimal policies for a database system with two backup schemes

Cunhua Qian; Yu Pan; Toshio Nakagawa[1]

  • [1] Department of Marketing and Information System, Aichi Institute of Technology, 1247 Yachigusa, Yakusa-cho, Toyota 470-0392, Japan

RAIRO - Operations Research - Recherche Opérationnelle (2002)

  • Volume: 36, Issue: 3, page 227-235
  • ISSN: 0399-0559

Abstract

top
This paper considers two backup schemes for a database system: a database is updated at a nonhomogeneous Poisson process and an amount of updated files accumulates additively. To ensure the safety of data, full backups are performed at time N T or when the total updated files have exceeded a threshold level K , and between them, cumulative backups as one of incremental backups are made at periodic times i T ( i = 1 , 2 , ⋯ , N - 1 ). Using the theory of cumulative processes, the expected cost is obtained, and an optimal number N * of cumulative backup and an optimal level K * of updated files which minimize it are analytically discussed. It is shown as examples that optimal number and level are numerically computed when two costs of backup schemes are given.

How to cite

top

Qian, Cunhua, Pan, Yu, and Nakagawa, Toshio. "Optimal policies for a database system with two backup schemes." RAIRO - Operations Research - Recherche Opérationnelle 36.3 (2002): 227-235. <http://eudml.org/doc/245216>.

@article{Qian2002,
abstract = {This paper considers two backup schemes for a database system: a database is updated at a nonhomogeneous Poisson process and an amount of updated files accumulates additively. To ensure the safety of data, full backups are performed at time $NT$ or when the total updated files have exceeded a threshold level $K$, and between them, cumulative backups as one of incremental backups are made at periodic times $iT$$(i=1, 2, \cdots \{\}, N-1$). Using the theory of cumulative processes, the expected cost is obtained, and an optimal number $N^*$ of cumulative backup and an optimal level $K^*$ of updated files which minimize it are analytically discussed. It is shown as examples that optimal number and level are numerically computed when two costs of backup schemes are given.},
affiliation = {Department of Marketing and Information System, Aichi Institute of Technology, 1247 Yachigusa, Yakusa-cho, Toyota 470-0392, Japan},
author = {Qian, Cunhua, Pan, Yu, Nakagawa, Toshio},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {database; full backup; cumulative backup; cumulative process; expected cost},
language = {eng},
number = {3},
pages = {227-235},
publisher = {EDP-Sciences},
title = {Optimal policies for a database system with two backup schemes},
url = {http://eudml.org/doc/245216},
volume = {36},
year = {2002},
}

TY - JOUR
AU - Qian, Cunhua
AU - Pan, Yu
AU - Nakagawa, Toshio
TI - Optimal policies for a database system with two backup schemes
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2002
PB - EDP-Sciences
VL - 36
IS - 3
SP - 227
EP - 235
AB - This paper considers two backup schemes for a database system: a database is updated at a nonhomogeneous Poisson process and an amount of updated files accumulates additively. To ensure the safety of data, full backups are performed at time $NT$ or when the total updated files have exceeded a threshold level $K$, and between them, cumulative backups as one of incremental backups are made at periodic times $iT$$(i=1, 2, \cdots {}, N-1$). Using the theory of cumulative processes, the expected cost is obtained, and an optimal number $N^*$ of cumulative backup and an optimal level $K^*$ of updated files which minimize it are analytically discussed. It is shown as examples that optimal number and level are numerically computed when two costs of backup schemes are given.
LA - eng
KW - database; full backup; cumulative backup; cumulative process; expected cost
UR - http://eudml.org/doc/245216
ER -

References

top
  1. [1] R.E. Barlow and F. Proschan, Mathematical Theory of Reliability. John Wiley & Sons, New York (1965). Zbl0132.39302MR195566
  2. [2] D.R. Cox, Renewal Theory. Methuen, London (1962). Zbl0103.11504MR153061
  3. [3] J.D. Esary, A.W. Marshall and F. Proschan, Shock models and wear processes. Ann. Probab. 1 (1973) 627-649. Zbl0262.60067MR350893
  4. [4] R.M. Feldman, Optimal replacement with semi-Markov shock models. J. Appl. Probab. 13 (1976) 108-117. Zbl0338.60062MR395794
  5. [5] S. Fukumoto, N. Kaio and S. Osaki, A study of checkpoint generations for a database recovery mechanism. Comput. Math. Appl. 1/2 (1992) 63-68. Zbl0782.68036
  6. [6] T. Nakagawa, On a replacement problem of a cumulative damage model. Oper. Res. Quarterly 27 (1976) 895-900. Zbl0345.90015MR421648
  7. [7] T. Nakagawa, A summary of discrete replacement policies. Eur. J. Oper. Res. 17 (1984) 382-392. Zbl0541.90046MR763572
  8. [8] T. Nakagawa and M. Kijima, Replacement policies for a cumulative damage model with minimal repair at failure. IEEE Trans. Reliability 13 (1989) 581-584. Zbl0695.90050
  9. [9] C.H. Qian, S. Nakamura and T. Nakagawa, Cumulative damage model with two kinds of shocks and its application to the backup policy. J. Oper. Res. Soc. Japan 42 (1999) 501-511. Zbl0998.90510MR1733246
  10. [10] T. Satow, K. Yasui and T. Nakagawa, Optimal garbage collection policies for a database in a computer system. RAIRO: Oper. Res. 4 (1996) 359-372. Zbl0859.68018
  11. [11] K. Suzuki and K. Nakajima, Storage management software. Fujitsu 46 (1995) 389-397. 
  12. [12] H.M. Taylor, Optimal replacement under additive damage and other failure models. Naval Res. Logist. Quarterly 22 (1975) 1-18. Zbl0315.90026MR436984

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.