Define deferred update technique of recovery, Database Management System

Assignment Help:

Discuss deferred update technique of recovery.  What are the advantages?

 Ans:  The deferred update methods do not physically update the database on disk till after a transaction reaches its commit point; after that the updates are recorded in the database. Alternatively, deferred update methods postpone any actual updating of the database on disk until a transaction arrives its commit point. The transaction force-writes the log to disk previous to recording the updates in the database

Advantages:

  • If a transaction fails previous to reaching its commit point, it will not have modified the database in any way, so UNDO is not required. Deferred update can lead to a recovery algorithm termed as NO-UNDO/REDO.
  • This approach, while used with specific concurrency control methods, is designed never to need transaction rollback, and recovery simply contains redoing the operations of transactions committed after the last checkpoint from the log.

Related Discussions:- Define deferred update technique of recovery

How does query tree represent relational algebra expression, How does a que...

How does a query tree represent a relational algebra expression?  Discuss any three rules for query optimisation, giving example as to when should each rule be applied.     Ans

What is the difference between link and reference, What is the difference b...

What is the difference between link and reference? The fundamental difference between links and references is that links are symmetrical on the other hand references refer only

Introduction to database technology, 1. Create the tables for the play-sche...

1. Create the tables for the play-scheme database as specified in the TMA. 2. Enter the data as given in the spreadsheet. 3. Create queries to retrieve specified information

Give the relational calculus queries of players in sql, An orchestra databa...

An orchestra database consists of the following relations: CONDUCTS (conductor, composition) REQUIRES (composition, Instrument) PLAYS (Player, Instrument) Give the relational

Deadlock and its prevention, Deadlock And Its Prevention: As seen earlier,...

Deadlock And Its Prevention: As seen earlier, though two phase locking protocol handles the trouble of serialisability, but it causes some troubles also. For instance, consider th

Data base design for a museum information system, In this practical assignm...

In this practical assignment, we will run through a complete database application development cycle, starting with the schema design, from an initial data import to database applic

Describe deductive databases and relational databases, Problem : (b) A ...

Problem : (b) A deductive database system is essentially the outcome of applying mathematics logic to database management, where logic is used for both data representation and

Cases of constraint violations, (1)     Insert into PERSON Violated con...

(1)     Insert into PERSON Violated constraint: - Key constraint Reason: - Primary key 1 already exists in PERSON. Dealing: - DBMS could ask the user to provide valid PER

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

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