adplus-dvertising
frame-decoration

Question

Which of the following does cursor stability ensure

a.

The tuple that is currently being processed by the iteration is locked in shared mode

b.

The tuple that is currently being processed is not locked in shared mode

c.

Any modified tuples are not locked in exclusive mode

d.

None of the mentioned

Posted under Concurrency Control DBMS

Answer: (a).The tuple that is currently being processed by the iteration is locked in shared mode

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following does cursor stability ensure

Similar Questions

Discover Related MCQs

Q. State true or false: Exclusive locks are held until transaction commit in degree two consistency

Q. In order to maintain transactional integrity and database consistency, what technology does a DBMS deploy?

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

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

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

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.

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

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

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

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?

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

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

Q. In a granularity hierarchy the highest level represents the

Q. In a database the file is contained in ________

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

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.

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

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.

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

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