Abstract Recovery

A set of recoverability theory is derived in this paper for object-based databases. Instead of considering serializability y and recoverability y as two orthogonal concepts, we simply keep serializability as the only correctness criterion and require serializability to be maintained even when failures of transactions may occur. Based on this fundamental notion of correctness, the definition of recoverability y is derived. The recoverability theory derived in thk way is a generalization of the traditional recoverability theory in the read/write model. In addition, we find that the set of strict histories depends on the strength of the inverse operations being used to cancel the effects of aborted operations. At one extreme, when the strongest inverse operations are used, the set of strict histories is the same as the set of avoid cascading aborts histories. At the other extreme, when the weakest inverse operations are used, the set of strict histories is the same as the set of rigorous histories.