adplus-dvertising
frame-decoration

Question

Database locking concept is used to solve the problem of

a.

Lost Update

b.

Uncommitted Dependency

c.

Inconsistent Data

d.

All of the above

Posted under Transactions DBMS

Answer: (d).All of the above

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Database locking concept is used to solve the problem of

Similar Questions

Discover Related MCQs

Q. A lock that allows concurrent transactions to access different rows of the same table is known as a

Q. A transaction completes its execution is said to be

Q. A system is in a ______ state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set.

Q. The deadlock state can be changed back to stable state by using _____________ statement.

Q. What are the ways of dealing with deadlock ?

Q. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled back (dies). This is

Q. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti ). This is

Q. The deadlock in a set of transaction can be determined by

Q. A deadlock exists in the system if and only if the wait-for graph contains a ___________.

Q. Selecting the victim to be rollbacked to the previous state is determined by the minimum cost. The factors determining cost of rollback is

Q. __________ rollback requires the system to maintain additional information about the state of all the running transactions.

Q. Which of these is data type long literal?

Q. Which of the following occurs when a transaction rereads data and finds new rows that were inserted by a command transaction since the prior read?

Q. A transaction for which all committed changes are permanent is called:

Q. In this instance, dirty reads are disallowed, while nonrepeatable reads and phantom reads are allowed.

Q. Which of the following occurs when a transaction rereads data it has previously read and finds modification or deletions caused by a committed transaction?

Q. A transaction may not always complete its execution successfully. Such a transaction is termed

Q. Transaction processing is associated with everything below except

Q. Transaction management ensures ____________ and __________ properties.

Q. ____________ is an interface between low level database and application program.