Q. Which of the following are introduced to reduce the overheads caused by the log-based recovery?

View solution

Q. Which of the following protocols ensures conflict serializability and safety from deadlocks?

View solution

Q. Which of the following is the block that is not permitted to be written back to the disk?

View solution

Q. If transaction Ti gets an explicit lock on the file Fc in exclusive mode, then it has an__________ on all the records belonging to that file.

View solution

Q. Which refers to a property of computer to run several operation simultaneously and possible as computers await response of each other

View solution

Q. All lock information is managed by a __________ which is responsible for assigning and policing the locks used by the transactions.

View solution

Q. The ____ lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.

View solution

Q. Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released?

View solution

Q. The situation where the lock waits only for a specified amount of time for another lock to be released is

View solution

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

View solution

Q. In a granularity hierarchy the highest level represents the

View solution

Q. In a database the file is contained in ________

View solution

Q. If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called

View solution

Q. If a node is locked in __________ explicit locking is being done at a lower level of the tree, but with only shared-mode locks.

View solution

Q. If a node is locked in ____________ then explicit locking is being done at a lower level, with exclusive-mode or shared-mode locks.

View solution

Q. If a node is locked in ______________ the subtree rooted by that node is locked explicitly in shared mode, and that explicit locking is being done at a lower level with exclusive-mode locks.

View solution

Q. ____________ denotes the largest timestamp of any transaction that executed write(Q) successfully.

View solution

Q. The _____________ ensures that any conflicting read and write operations are executed in timestamp order.

View solution

Q. The __________ requires that each transaction Ti executes in two or three different phases in its lifetime, depending on whether it is a read-only or an update transaction.

View solution

Q. This validation scheme is called the _________ scheme since transactions execute optimistically, assuming they will be able to finish execution and validate at the end.

View solution