Question
a.
Cursor stability
b.
Serializability
c.
Non-serializability
d.
Predicate locking
Posted under DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. _________ is a form of two degree consistency designed for programs that iterate over tuples of a relation by using cursors.
Similar Questions
Discover Related MCQs
Q. Transactions that involve user interactions are called __________
View solution
Q. State true or false: Key value locking provides increased concurrency
View solution
Q. To prevent the phantom phenomenon, _______ is used
View solution
Q. Which of the following does cursor stability ensure
View solution
Q. State true or false: Exclusive locks are held until transaction commit in degree two consistency
View solution
Q. In order to maintain transactional integrity and database consistency, what technology does a DBMS deploy?
View solution
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
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!