A system is in a              state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set.

Related MCQs

• If several concurrent transactions are executed over the same data set and the second transaction updates the database before the first transaction is finished, the ____ property is violated and the database is no longer consistent.
• A concurrency-control policy such as this one leads to              performance since it forces transactions to wait for preceding transactions to finish before they can start.
• Each of a pair of transactions has read data that is written by the other, but there is no data written by both transactions, is referred to as
• The relation EMPDT1 is defined with attributes empcode(unique), name, street, city, state, and pincode. For any pincode, there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms EMPDT1 is a relation in
• Empdt1(empcode, name, street, city, state, pincode). For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in
• A(n) ____ lock exists when concurrent transactions are granted Read access on the basis of a common lock.
• A lock that prevents the use of any tables in the database from one transaction while another transaction is being processed is called a
• The command                                  such tables are available only within the transaction executing the query and are dropped when the transaction finishes.
•                      are used to ensure that transactions access each data item in order of the transactions’          if their accesses conflict.
• If an transaction is performed in a database and committed, the changes are taken to the previous state of transaction by