Database Management System Question
Database Management System Question With Answer & Solution
Que. - Which refers to a property of computer to run several operation simultaneously and possible as computers await response of each other
Que. - The lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.
Que. - 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?
Que. - 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.
Que. - The deadlock state can be changed back to stable state by using statement.
Que. - What are the ways of dealing with deadlock?
Que. - When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled back (dies). This is
Que. - When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti). This is
Que. - The situation where the lock waits only for a specified amount of time for another lock to be released is
Que. - The deadlock in a set of a transaction can be determined by
Showing
781
To
790 of 1293 results