Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T10:17:51.287Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Policies for a Database Systemwith Two Backup Schemes

Published online by Cambridge University Press:  15 April 2003

Cunhua Qian ,
Yu Pan  and
Toshio Nakagawa
Cunhua Qian
Affiliation:
College of Management Science and Engineering, Nanjing University of Technology, Nanjing 210009, China; qch64317@hotmail.com., panyu@dns.njuct.edu.cn.
Yu Pan
Affiliation:
College of Management Science and Engineering, Nanjing University of Technology, Nanjing 210009, China; qch64317@hotmail.com., panyu@dns.njuct.edu.cn.
Toshio Nakagawa
Affiliation:
Department of Marketing and Information System, Aichi Institute of Technology, 1247 Yachigusa, Yakusa-cho, Toyota 470-0392, Japan; nakagawa@mkt.aitech.ac.jp.
Get access

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,...,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.

Keywords

Databasefull backupcumulative backupcumulative processexpected cost.

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 36 , Issue 3 , July 2002 , pp. 227 - 235
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

R.E. Barlow and F. Proschan, Mathematical Theory of Reliability. John Wiley & Sons, New York (1965).
D.R. Cox, Renewal Theory. Methuen, London (1962).
Esary, J.D., Marshall, A.W. and Proschan, F., Shock models and wear processes. Ann. Probab. 1 (1973) 627-649. CrossRef
Feldman, R.M., Optimal replacement with semi-Markov shock models. J. Appl. Probab. 13 (1976) 108-117. CrossRef
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.
Nakagawa, T., On a replacement problem of a cumulative damage model. Oper. Res. Quarterly 27 (1976) 895-900. CrossRef
Nakagawa, T., A summary of discrete replacement policies. Eur. J. Oper. Res. 17 (1984) 382-392. CrossRef
Nakagawa, T. and Kijima, M., Replacement policies for a cumulative damage model with minimal repair at failure. IEEE Trans. Reliability 13 (1989) 581-584. CrossRef
Qian, C.H., Nakamura, S. and Nakagawa, T., Cumulative damage model with two kinds of shocks and its application to the backup policy. J. Oper. Res. Soc. Japan 42 (1999) 501-511.
Satow, T., Yasui, K. and Nakagawa, T., Optimal garbage collection policies for a database in a computer system. RAIRO: Oper. Res. 4 (1996) 359-372. CrossRef
Suzuki, K. and Nakajima, K., Storage management software. Fujitsu 46 (1995) 389-397.
Taylor, H.M., Optimal replacement under additive damage and other failure models. Naval Res. Logist. Quarterly 22 (1975) 1-18. CrossRef