Abstract
The goal of checkpointing in database management systems is to save database states on a separate secure device so that the database can be recovered when errors and failures occur. Recently, the possibility of having a checkpointing mechanism which does not interfere with the transaction processing has been studied. The property of noninterference is highly desirable in real-time applications, where restricting transaction activity during the checkpointing operation is in many cases not feasible. The practicality of a noninterfering checkpointing algorithm is studied here by analyzing the extra workload of the algorithm. The noninterfering checkpointing results in some overhead on the one hand, and increases the system availability on the other hand. For the applications where the ability of continuous processing of transactions is so critical that the blocking of transaction processing for checkpointing is not feasible, it is believed that noninterfering checkpointing provides a practical solution to the problem of constructiing globally consistent states in distributed database systems.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 234-241 |
| Number of pages | 8 |
| ISBN (Print) | 0818607491 |
| State | Published - 1986 |