A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
This paper discusses checkpoint generations for a database recovery mechanimm. 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 generationJ 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.doi:10.1016/0898-1221(92)90229-b fatcat:2tgxgbmb75ec7o6tlgbmq2ovoe