An adaptive checkpointing scheme for distributed databases with mixed types of transactions
- 6 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (4) , 528-535
- https://doi.org/10.1109/icde.1988.105500
Abstract
A checkpointing algorithm is presented that does not interfere with transaction processing. The correctness of the algorithm is shown, and the robustness of the algorithm and the recovery procedures associated with it are discussed. The algorithm provides a practical solution to the problem of checkpointing and recovery in distributed database systemsKeywords
This publication has 11 references indexed in Scilit:
- An algorithm for non-interfering checkpoints and its practicality in distributed database systemsInformation Systems, 1989
- Optimal Checkpointing of Real-Time TasksIEEE Transactions on Computers, 1987
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processorsPublished by Association for Computing Machinery (ACM) ,1983
- Global States of a Distributed SystemIEEE Transactions on Software Engineering, 1982
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- Nonblocking commit protocolsPublished by Association for Computing Machinery (ACM) ,1981
- Reliability mechanisms for SDD-1ACM Transactions on Database Systems, 1980
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976