Deadlock prevention, Database Management System

Deadlock Prevention

One of the easiest approaches for avoiding a deadlock would be to obtain all the locks at the begin of the transaction. Though, this approach restricts concurrency very much, also you may lock some of the items that are not updated by that transaction (the transaction may contain if conditions).Therefore, better prevention algorithm have been evolved to stop a deadlock having the basic logic: not to permit circular wait to occur. This approach rolls back some of the transactions instead of letting them wait.

 

Posted Date: 3/12/2013 3:05:17 AM | Location : United States







Related Discussions:- Deadlock prevention, Assignment Help, Ask Question on Deadlock prevention, Get Answer, Expert's Help, Deadlock prevention Discussions

Write discussion on Deadlock prevention
Your posts are moderated
Related Questions
Differentiate between a Global and a Local temporary table? - A local temporary table exists only for the duration of a connection or if defined inside a compound statement, fo

Describe DROP TABLE command of SQL along with both the options - CASCADE and RESTRICT. DROP TABLE command - This command drops the specified table. Dropping a table also dro

Explain the rules for creating a labelled precedence graph for testing view serializability.            Ans: A schedule S is view serializable if it is view equivalent to a ser

Adding Redundant Associations for Efficient Access Redundant associations do not add any type of information, therefore during design we should actually examine structure of o

The External or View Level The external or view level is the highest level of abstraction of database. It gives a window on the conceptual view, which permits the user to see

Explain the EXISTS and UNIQUE functions of SQL. Give an example for each? EXISTS: The EXISTS function takes one parameter that is a SQL statement. If any records exist which

what is database management system? & why it is required?

What are object interaction diagrams? Object interaction diagrams are the diagrams that used to describe order in which messages are communicated in execution of an operation,

While using extract datasets it is required to have a special workarea for interface False.  It is not required to have a special workarea for interface

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider