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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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.

View solution

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

View solution