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

Q. Which of the following timestamps is used to record the time when a transaction has finished its read phase?

View solution

Q. Which of the following timestamps is used to record the time when a database has completed its write operation?

View solution

Q. State true or false: Locking and timestamp ordering force a wait or rollback whenever a conflict is detected.

View solution

Q. State true or false: We determine the serializability order of validation protocol by the validation ordering technique

View solution

Q. In _______ schemes, each write operation creates a new version of Q

View solution

Q. If the first update is overwritten by a second, it is called as a _______ update

View solution

Q. State true or false: Snapshot isolation prevents lost updates

View solution

Q. Which of the following is a variant of snapshot isolation

View solution

Q. Under ________ the system uses locking mechanism that applies only to updates

View solution

Q. The situation in which each pair of transactions has read a data written by the other, but there is no data written by the transactions is called as _______

View solution