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

Q. The most recent version of standard SQL prescribed by the American National Standards Institute is

View solution

Q. ANSI-standard SQL allows the use of special operators in conjunction with the WHERE clause. A special operator used to check whether an attribute value is null is

View solution

Q. A lock that prevents the use of any tables in the database from one transaction while another transaction is being processed is called a

View solution

Q. A condition that occurs when two transactions wait for each other to unlock data is known as a(n)

View solution

Q. Which of the following is not true about B+ trees?

View solution

Q. The extent of the database resource that is included with each lock is called the level of

View solution

Q. Snapshot isolation is a particular type of ______________ scheme.

View solution