How does the system cope up with a record crash, Database Management System

Assignment Help:

How does the system cope up with a record crash when recovery is going on after the first crash?

Ans:  In a system the undo and redo operations are needed to be idempotent to cope up with a record crash while recovery is going on after the crash. Because of the idempotent property, recovery process, whereas in the process of undoing or redoing the actions of a transaction, may fail without a trace, and this kind of failure can take place any number of times before the recovery is done successfully.


Related Discussions:- How does the system cope up with a record crash

Transactions t1 and t2 are in a deadlock, Evaluate: a.When transactions...

Evaluate: a.When transactions T1 and T2 are in a deadlock, one of the transactions will eventually implement to completion and let the other one continue implementation. b.

Draw the dependency diagram for the relation, Consider the subsequent relat...

Consider the subsequent relation   Professor (Pfcode, dept, head, time)   It is assumed that      (i) A professor can work in much more than one

What is index, What is Index? An index is a physical structure having p...

What is Index? An index is a physical structure having pointers to the data. Indices are created in an existing table to locate rows more quickly and efficiently. It is possibl

What is meant by functional dependencies, What is meant by functional depen...

What is meant by functional dependencies? Consider a relation schema R and α C R and β C R. The functional dependency α ->β  holds on relational schema R if in any legal relati

Managing databases, 10A.53 Code an Oracle Database trigger to enforce the...

10A.53 Code an Oracle Database trigger to enforce the constraint that an employee can never change his or her department. 10A.54 Code an Oracle Database trigger to allow the

Name the metrics for selecting top algorithm, Name the metrics for selectin...

Name the metrics for selecting top algorithm There are a number of metrics for selecting top algorithm: i) Computational complexity: Computational complexity refers to eff

Cartisian product, Explain the cartesian product in Database Management Sys...

Explain the cartesian product in Database Management System

Define- relational algebra, Define- relational algebra. The relational ...

Define- relational algebra. The relational algebra is a procedural query language. It having of a set of operations that take one or two relation as input and make a new relati

Many-to-many relationship, For each m:n relationship type R, we make a new ...

For each m:n relationship type R, we make a new table (say S) to represent R. We also contain the primary key attributes of both the participating entity types as a foreign key att

Which database object does not physically exist, Which database object does...

Which database object does not physically exist? A view database object does not physically exist.

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