Data backup policies with failure-oblivious computing in reliability theory

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 348; číslo 1; s. 117 - 146
Hlavní autoři: Zhao, Xu-Feng, Wang, Dong, Mizutani, Satoshi, Nakagawa, Toshio
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.05.2025
Springer Nature B.V
Témata:
Back up systems
Backups
Business and Management
Combinatorics
Computation
Computer memory
Data base management systems
Data recovery
Failure
Operations Research/Decision Theory
Original Research
Policies
Stochastic processes
Theory of Computation
Reliability theory
Bulk-data
Memory error
Incremental backup
In-memory database
ISSN:0254-5330, 1572-9338
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-022-04941-8