Abstract
Abstmcf-The goal of checkpointing in database management systems is to save database slates on a separate secure device so that the database can be recovered when errors and fallures occur. Recently, the possibility of having a checkpointing mechanism whicb does not interfere with the transaction processing has been studied [4], 17. Users are allowed to submit transactions while the checkpointing is in prqres, and the transnctions are performed in the system concurrently with the checkpointing process. This property of noninterferelrc+ is highly desirable to real-time applications, where restricting transaction activity during the checkpointing operation is in many cases not feasible. In this paper, 8 new algorithm for checkpointing in distributed database systems is proposed and its correctness is proved, The practicality of the algorithm is discussed by analyzing the extra workload and the robustness of it with respect to site fallures.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
