Consistent Checkpointing in Distributed Databases: Towards a Formal Approach

TL;DR

This paper presents a formal condition for determining the consistency of distributed data checkpoints and introduces non-intrusive protocols based on this condition, bridging data object and process models.

Contribution

It provides a necessary and sufficient condition for global checkpoint consistency and derives protocols from this condition, connecting data and process models.

Findings

Established a formal condition for checkpoint consistency.

Derived non-intrusive checkpointing protocols.

Bridged data object/transaction and process/message-passing models.

Abstract

Whether it is for audit or for recovery purposes, data checkpointing is an important problem of distributed database systems. Actually, transactions establish dependence relations on data checkpoints taken by data object managers. So, given an arbitrary set of data checkpoints (including at least a single data checkpoint from a data manager, and at most a data checkpoint from each data manager), an important question is the following one: ``Can these data checkpoints be members of a same consistent global checkpoint?''. This paper answers this question by providing a necessary and sufficient condition suited for database systems. Moreover, to show the usefulness of this condition, two {\em non-intrusive} data checkpointing protocols are derived from this condition. It is also interesting to note that this paper, by exhibiting ``correspondences'', establishes a bridge between the data object/transaction model and the process/message-passing model.