adplus-dvertising
frame-decoration

Question

Backward recovery is which of the following?

a.

Where the before-images are applied to the database

b.

Where the after-images are applied to the database

c.

Where the after-images and before-images are applied to the database

d.

Switching to an existing copy of the database

Posted under Transactions DBMS

Answer: (a).Where the before-images are applied to the database

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Backward recovery is which of the following?

Similar Questions

Discover Related MCQs

Q. Which of the following contains a complete record of all activity that affected the contents of a database during a certain period of time?

Q. In database management system, the executing process or executing program which considers the updating or reading of records stored in database is called

Q. The application of database management system in air flight seat booking in a way that one seat is accessed by only one clerk for customer reservation is classified as

Q. Collections of operations that form a single logical unit of work are called __________

Q. The “all-or-none” property is commonly referred to as _________

Q. Which of the following is a property of transactions?

Q. Execution of translation in isolation preserves the _________ of a database

Q. Which of the following is not a property of a transaction?

Q. Which of the following systems is responsible for ensuring durability?

Q. Which of the following systems is responsible for ensuring isolation?

Q. State true or false: Information residing in the volatile storage does not usually survive system crashes

Q. A transaction that has not been completed successfully is called as _______

Q. Which of the following is not a transaction state?

Q. The execution sequences in concurrency control are termed as ________

Q. The scheme that controls the interaction between executing transactions is called as _____

Q. I and J are _________ if they are operations by different transactions on the same data item, and at least one of them is a write operation.

Q. If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are

Q. A schedule is __________ if it is conflict equivalent to a serial schedule.

Q. The set of ________ in a precedence graph consists of all the transactions participating in the schedule

Q. A ___________of the transactions can be obtained by finding a linear order consistent with the partial order of the precedence graph.