Q. The _________ graph describes deadlocks precisely

View solution

Q. How do we generally recover from a deadlock?

View solution

Q. State true or false: Partial rollback is not possible.

View solution

Q. Which of the following steps must be taken while choosing a victim?

View solution

Q. Which of the following cannot be used to implement a timestamp

View solution

Q. A logical counter is _________ after a new timestamp has been assigned

View solution

Q. W-timestamp(Q) denotes?

View solution

Q. R-timestamp(Q) denotes?

View solution

Q. A ________ ensures that any conflicting read and write operations are executed in timestamp order

View solution

Q. The default timestamp ordering protocol generates schedules that are

View solution

Q. State true or false: The Thomas write rule has a greater potential concurrency than the timestamp ordering protocol

View solution

Q. Which of the following timestamp based protocols generates serializable schedules?

View solution

Q. In timestamp ordering protocol, suppose that the transaction Ti issues read(Q) and TS(Ti)<W-timestamp(Q), then

View solution

Q. In timestamp ordering protocol, suppose that the transaction Ti issues write(Q) and TS(Ti)<W-timestamp(Q), then

View solution

Q. The _________ requires each transaction executes in two or three different phases in its lifetime

View solution

Q. During __________ phase, the system reads data and stores them in variables local to the transaction.

View solution

Q. During the _________ phase the validation test is applied to the transaction

View solution

Q. During the _______ phase, the local variables that hold the write operations are copied to the database

View solution

Q. Read only operations omit the _______ phase

View solution

Q. Which of the following timestamp is used to record the time at which the transaction started execution?

View solution