The recovery manager of a data management system

ACM Transactions on Database Systems, 1992

DB2 TM , IMS, and Tandem TM systems. ARIES is applicable not only to database management systems but also to persistent object-oriented languages, recoverable file systems and transaction-based operating systems. ARIES has been implemented, to varying degrees, in IBM's OS/2 TM Extended Edition Database Manager, DB2, Workstation Data Save Facility/VM, Starburst and QuickSilver, and in the University of Wisconsin's EXODUS and Gamma database machine.

1979

An algorithm is described which guarantees reliable storage of data in a distributed system, even when different portions of the data base, stored on separate machines, are updated as part of a single transaction. The algorithm is implemented by a hierarchy of rather simple abstractions, and it works properly regardless of crashes of the client or servers. Some care is taken to state precisely the assumptions about the physical components of the system (storage, processors and communication).

IEEE Systems, Man and Cybernetics SocietyInformation Assurance Workshop, 2003., 2003

Iee Proceedings - Software Engineering, 1997

The authors discuss backward error recovery for complex software systems, where different subsystems may belong to essentially different application areas. Such heterogeneous subsystems are naturally built according to different design 'models', namely the 'objectaction' model (where the long-term state of the computation is encapsulated in data objects, and active processes invoke operations on these objects), and the 'process-conversation' model (where the state is contained in the processes, communicating via messages). To allow backward error recovery in these two 'models' of computation, two different schemes are most appropriate: atomic transactions for the objectaction model, and conversations for the processconversation model. Assuming that each of these two kinds of subsystem already has functioning mechanisms for backward error recovery, the authors describe the additional provisions needed for co-ordination between these heterogeneous subsystems. The solution involves altering the virtual machine on which the programs run, and programming conventions which seem rather natural and can be automatically enforced. The approach is demonstrated by a simple example.

Lecture Notes in Computer Science, 2007

Replication is used for providing highly available and fault-tolerant information systems, which are constructed on top of replication and recovery protocols. An important aspect when designing these systems is the assumed failure model. Replicated databases literature last trends consist in adopting the crash-recovery with partial amnesia failure model because in most cases it shortens the recovery times. But, despite the large use of such failure model we consider that most of these works do not handle accurately the amnesia phenomenon. Therefore, in this paper we survey some works, analyzing their amnesia support. In this study, we focus on primary component membership systems. The same principles could be applied for partitionable or mobile systems, but we have not surveyed them.

We discuss a design scheme for co-ordinated backward recovery in complex systems. This report concludes a series of papers on this topic. We give the rationale of our proposed approach, a complete, reasoned specification of the mechanisms, a comparison with other related research, and pointers to other papers describing proof-of-concept examples of use and implementation of this scheme..

IBM Research …, 2002

for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g. , payment of royalties). Copies may be requested from IBM T.

2009

We have addressed the complex problem of recovery for concurrent failures in distributed computing environment. We have proposed a new approach in which we have effectively dealt with both orphan and lost messages. The proposed checkpointing and recovery approaches enable each process to restart from its recent checkpoint and hence guarantee the least amount of recomputation after recovery. It also means that a process needs to save only its recent local checkpoint. In this regard, we have introduced two new ideas. First, the proposed value of the common checkpointing interval is such that it enables an initiator process to log the minimum number of messages sent by each application process. Second, the determination of the lost messages is always done a priori by an initiator process; besides it is done while the normal distributed application is running. This is quite meaningful because it does not delay the recovery approach in any way.

1986

There are many examples of actions on abstract data types which can be correctly implemented with nonserralizable and nonrecoverable schedules of reads and writes We examme a model of multiple layers of abstraction that explains this phenomenon and suggests an approach to burldmg layered systems with transaction oriented synchromzatron and roll back Our model may make rt easier to provide the high data mtegrrty of reliable database transaction processmg m a broader class of mformatron systems We concentrate on the recovery aspects here, a technical report [Moss et al 851 has a more complete drscussron of concurrency control

Information Sciences, 1999

User-interactive undo is a kind of recovery facility that allows users to correct mistakes easily by canceling and reexecuting operations that have already been executed. Supporting user-interactive undo is essential for authoring processes in new database applications such as software engineering, hypermedia, and computer-aided design. A partial rollback using savepoints supported by commercial database management systems (DBMSs), which allows only cancellation of executed operations, is a restricted form of user-interactive undo. Although many applications use DBMSs, they have to provide user-interactive undo by themselves due to lack of support from the DBMSs. Since implementation of user-interactive undo is quite complex, it poses significant burden to application programmers. This paper proposes a new recovery method facilitating user-interactive undo in DBMSs. Such a facility relieves the programmers of implementing user-interactive undo themselves in developing DBMS applications. The method guarantees fast rollback of transactions that contain user-interactive undos. It also provides users with the bulk undo operation that restores the database to a predetermined point in the past. The bulk undo operation resembles partial rollback, but