Abstract
The goal of checkpointing in database management systems is to save database states so that the database can be recovered when errors and failures occur. Checkpointing is performed during normal operation of the system, and therefore its overhead, including interference with transaction processing, must be kept to a minimum. In this paper, a new scheme for checkpointing in distributed database systems is introduced and the correctness of the scheme is proved using a formal model of distributed computation.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Editors | Kane H. Kim, K. Chon, C.V. Ramamoorthy |
| Publisher | North-Holland |
| Pages | 331-337 |
| Number of pages | 7 |
| ISBN (Print) | 0444700226 |
| State | Published - 1986 |