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

Create the database in oracle using ddl, The Assessment page has a link to ...

The Assessment page has a link to download a conceptual model, and a list of data. You are to map this conceptual model, and create the database in Oracle using your own DDL.  T

Which file organization provides very fast access, Which file organization ...

Which file organization provides very fast access to any arbitrary record of a file? Hashed file organization provides very fast access to any arbitrary record of a file.

An Apriori algorithm, Submission Requirements All answers must be co...

Submission Requirements All answers must be computer generated (including text and diagrams). The hand-in version must include a header page (or with sufficient space)

What is horizontal fragmentation, What is horizontal fragmentation? Hor...

What is horizontal fragmentation? Horizontal fragmentation divides the relation by assuming every tuple of r to one or more fragments

What is the use of group by clause, What is the use of group by clause? ...

What is the use of group by clause? Group by clause is used to be relevant aggregate functions to a set of tuples. The attributes given in the group by clause are used to shape

Define deadlock avoidance, Define Deadlock avoidance These protocols a...

Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I

What is a hashing function, What is a hashing function?  What are the prope...

What is a hashing function?  What are the properties of a good hashing function?  Describe the folding technique for hashing functions.      Ans:  Hashing function is a method

Estimate the transaction states, Suppose an instruction takes 1 nanosecond ...

Suppose an instruction takes 1 nanosecond to execute (on average), a page fault takes 20 microseconds of processor time, and it takes 300 microseconds of disk time to read or write

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

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