IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v348y2025i1d10.1007_s10479-022-04941-8.html
   My bibliography  Save this article

Data backup policies with failure-oblivious computing in reliability theory

Author

Listed:
  • Xu-Feng Zhao

    (Nanjing University of Aeronautics and Astronautics)

  • Dong Wang

    (Nanjing University of Aeronautics and Astronautics)

  • Satoshi Mizutani

    (Aichi Institute of Technology)

  • Toshio Nakagawa

    (Aichi Institute of Technology)

Abstract

In-memory database systems are becoming an efficient technology to achieve the goal of high throughput rate and low latency time, however, they are more vulnerable than disk-based database systems due to the feature of their running carriers, so that it becomes a critical problem to design data backup and recovery policies to prevent memory failures for in-memory database management systems. From this viewpoint, this paper firstly describes the stochastic processes of bulk-data update, triggers of failure-oblivious computing and in-memory database failure, and then model the expected cost rates for data backup and recovery when full backups are implemented at time T and at bulk-data update N, respectively. In order to compare the policies of T and N, integrated models of the backup policies implemented at time T and at bulk-data update N are studied, using the triggering approaches of first and last in maintenance theory. Furthermore, the policies of T and N are reconsidered when full backup is planned at the completion of the forthcoming bulk-data update. In addition, a cumulative cost of failure-oblivious computing is considered in the modified backup policies. All of the expected cost rates and their optimum policies of full backups are obtained in analytical ways.

Suggested Citation

  • Xu-Feng Zhao & Dong Wang & Satoshi Mizutani & Toshio Nakagawa, 2025. "Data backup policies with failure-oblivious computing in reliability theory," Annals of Operations Research, Springer, vol. 348(1), pages 117-146, May.
  • Handle: RePEc:spr:annopr:v:348:y:2025:i:1:d:10.1007_s10479-022-04941-8
    DOI: 10.1007/s10479-022-04941-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04941-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-022-04941-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:348:y:2025:i:1:d:10.1007_s10479-022-04941-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.