The Community for Technology Leaders
Green Image
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 ofvalues 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.
Index Termsdistributed databases; consistent snapshots; transaction-consistent checkpoints;checkpointing; concurrency control protocols; two-phase locking; timestamping;concurrency control; database theory; distributed databases

T. Kameda and S. Pilarski, "Checkpointing for Distributed Databases: Starting from the Basics," in IEEE Transactions on Parallel & Distributed Systems, vol. 3, no. , pp. 602-610, 1992.
91 ms
(Ver 3.3 (11022016))