Failures and recovery, Database Management System

Assignment Help:

Failures and Recovery

In practice various things might occur to prevent a transaction from completing. Recovery methods are used to bring database, which does not satisfy consistency needs, into a consistent state.  If a transaction finishes normally and commits then all the alters made by the transaction on the database are permanently registered in the database. They should not be lost. But, if a transaction does not finish normally and terminates abnormally then all the changes made by it should be discarded.  An abnormal termination of a transaction may be because of various causes, including:

a)  User may decide to terminate the transaction issued by him/ her

 b)  There may be a deadlock in the system

c)   There may be a system failure.

The recovery mechanisms must make sure that a consistent state of database can be restored under all circumstances.  In case of transaction terminate or deadlock, the system remains in control and can deal with the failure but in case of a system failure the system loses control because the computer itself has failed. Will the results of such type of failure be catastrophic? A database has a vast amount of useful information and any system failure should be recognised on the restart of the system. The DBMS should recover from some such failures.

 


Related Discussions:- Failures and recovery

Explain concept of inheritance with support of example, Explain concept of ...

Explain concept of inheritance with support of suitable example. Inheritance Inheritance is one of milestone of object-oriented programming language as it allows a creati

Develop motel point of sale software, Project Description: I need a poin...

Project Description: I need a point of sale for motels. It needs to run on windows and requires being network able so that we can have more than one computer using it at once.

What is message switching, What is Message switching Message switching ...

What is Message switching Message switching transmits data units which can be arbitrarily long. Packet switching has a utmost packet size, if any message longer than that, it s

What is a candidate key, What is a candidate key? Minimal super keys ar...

What is a candidate key? Minimal super keys are known as candidate keys.

Describe participation constraints, Describe Participation Constraints? ...

Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another

What is the aim of logical schema, What is the aim of logical schema ? ...

What is the aim of logical schema ? The main motive of the logical schema is to ensure the portability of procedures and models on various physical schemas at runtime.

find a non-redundant cover and canonical cove, Given the following set of ...

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

Sparse and dense indexes, Sparse and Dense Indexes These indexes in pri...

Sparse and Dense Indexes These indexes in principle are the similar as that of indexes used at the back of the book. The key facts of the indexes are: They are arranged

Describe the algorithm to draw the dependency graph, Describe the algorithm...

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd