Recovery techniques, Database Management System

Assignment Help:

Recovery Techniques:After Reading the types of failures and database errors, let us talk about how to recover from the failures. Recovery can be complete using/restoring the previous consistent state (backward recovery) or by moving forward to the next consistent state as per the committed transactions recovery (forward recovery).  Please note that a system can recover from software and hardware failures by using the forward and backward recovery only if the system log is intact.  What is the system log? We will talk about it in more detail, but first let us describe forward and backward recovery.

 


Related Discussions:- Recovery techniques

How does oracle act as odbc and give example for front end, How does Oracle...

How does Oracle act as ODBC and give examples of front end uses with ODBC? ODBC achieve portability at the level of the executable by introducing an extra level of indirection.

Define the boyce-codd normal form, Define the Boyce-Codd Normal Form with i...

Define the Boyce-Codd Normal Form with instance and also Compare BCNF and 3NF.  Ans: BCNF: For each functional dependency X->Y in a set F of functional dependencies over relati

Constraints violation during insertion, If the insertion violates one or mo...

If the insertion violates one or more constraints, then two alternatives are available: Default option: - Insertion can be discarded and the reason of refusal can also be ex

Insert statement reverses storage space and transfers value, A field-groups...

A field-groups statement or an insert statement reverses storage space and transfers values. False.

Determine the minimal set of functional dependencies, Determine the minimal...

Determine the minimal set of functional dependencies for the following data. This table is part of the OHSU database of extracurricular activities and tracks the DMICE band's co

Differentiate between b-tree and b+ tree, Differentiate between B-tree and ...

Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

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