Checkpointing for distributed databases: starting from the basics

Author

Pilarski, Slawomir ; Kameda, Tiko

Author_Institution

Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada

Volume

3

Issue

5

fYear

1992

fDate

9/1/1992 12:00:00 AM

Firstpage

602

Lastpage

610

Abstract

Checkpointing in a distributed database system is analyzed by establishing a correspondence between consistent snapshots in a general distributed system and transaction-consistent checkpoints in a distributed database system. The analysis culminates in a useful condition for transaction-consistent checkpoints. Based on this condition, a general checkpointing scheme, which records a transaction-consistent set of values of all or some selected data items is presented. These rules are implemented in some representative concurrency control protocols, i.e., those based on two-phase locking and timestamping. These implementations cause little interference with other activities in the database system

Keywords

concurrency control; database theory; distributed databases; checkpointing; concurrency control protocols; consistent snapshots; distributed databases; timestamping; transaction-consistent checkpoints; two-phase locking; Abortion; Checkpointing; Computational modeling; Concurrency control; Database systems; Distributed databases; Indexes; Interference; Protocols; Transaction databases;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.159043

Filename

159043