A lock that allows concurrent transactions to access different rows of the same table is known as a

Related MCQs

• A lock that allows concurrent transactions to access different rows of the same table is known as a
• A lock that allows concurrent transactions to access different rows of the same table is known as a
• A(n) ____ lock exists when concurrent transactions are granted Read access on the basis of a common lock.
• The          lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.
• The ____ lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.
• Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
• Which lock should be obtained to prevent a concurrent transaction from executing a conflicting read, insert or delete operation on the same key value.
• The situation where the lock waits only for a specified amount of time for another lock to be released is
• In a ____ lock, the DBMS will lock an entire disk page.
• Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.