Consistent Checkpointing in Distributed Databases: Towards a Formal Approach

Details Consistent Checkpointing in Distributed Databases: Towards a Formal Approach Consistent Checkpointing in Distributed Databases: Towards a Formal Approach

1999-10-22

arxiv.org/abs/cs/9910019v1

Computer Science

Databases

13 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Consistent Checkpointing in Distributed Databases: Towards a Formal Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Consistent Checkpointing in Distributed Databases: Towards a Formal Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consistent Checkpointing in Distributed Databases: Towards a Formal Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427130