adplus-dvertising
frame-decoration

Question

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

a.

Serializability order

b.

Direction graph

c.

Precedence graph

d.

Scheduling scheme

Posted under DBMS

Answer: (a).Serializability order

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. State true or false: If I = read(Q) and J = read(Q) then the order of I and J does not matter.

Q. State true or false: If I = read(Q) and J = write(Q) then the order of I and J does not matter.

Q. Which of the following is the most expensive method?

Q. A transaction that performs only one operation is called as a _________

Q. The phenomenon in which one failure leads to a series of transaction rollbacks is called as ________

Q. State true or false: Every cascadeless schedule is also recoverable

Q. A ___________ is one where, for each pair of transactions Ti and Tj such that Tj reads a data item previously written by Ti , the commit operation of Ti appears before the commit operation of Tj

Q. State true or false: Transactions can only run serially

Q. Which of the following are the advantages of transaction concurrency?

Q. The average time for a transaction to be completed after it has been submitted is called as __________

Q. If a schedule is equivalent to a serial schedule, it is called as a _________

Q. Which of the following is not a type of a schedule?

Q. Which of the following is a transaction isolation level as specified by SQL standard?

Q. State true or false: Serializable level may allow both serializable and non-serializable executions

Q. ________ allows only committed data to be read and further requires that no other transaction is allowed to update it between two reads of a data item by a transaction.

Q. ________ allows only committed data to be read, but does not require repeatable reads

Q. ___________ allows uncommitted data to be read

Q. State true or false: All the isolation levels disallow dirty writes

Q. When is a timestamp allotted

Q. In ___________ isolation each transaction is given its own version of the database