A study of checkpoint generations for a database recovery mechanism

Abstract This paper discusses checkpoint generations for a database recovery mechanism. The density of checkpoint generations is analytically derived from minimizing the expected total overhead to completion of a phase, and this density yields the optimum sequence of checkpoint generations measured in unit of update pages. We further present the numerical examples for the results obtained and show that the sequence gives effective checkpoint generations.