Explain the concept of deadlock, Database Management System

Assignment Help:

Question:

In a multi-user database environment, locking mechanisms can be used to solve the three basic problems of concurrency. On the other hand, however, locking may also lead to an undesirable problem of deadlock.

(a) Explain the concept of deadlock, and give an example of a deadlock situation as a result of locking.

(b) There are three main problems related to concurrency in multi-user database systems: lost updates, inconsistent analysis, and uncommitted dependency.

(i) Discuss the different types of locking mechanisms which can be used to overcome these problems support your answer with appropriate example.

(ii) Describe the concept of granularity level for locking, and discuss the effect of locking granularity on the degree-concurrency: in the database systems.


Related Discussions:- Explain the concept of deadlock

Importance of file organisation in database, Importance Of File Organisatio...

Importance Of File Organisation In Database To execute a database efficiently, there are various design tradeoffs needed. One of the most vital ones is the file Organisation. F

Define various ways in which select statement, Define various ways in which...

Define various ways in which SELECT statement can be used for record selection Technology?  SELECT gives you control over a number of aspects for record retrieval: 1) Which

Define two-phase locking protocol, Define two-phase locking protocol. A...

Define two-phase locking protocol. Ans: Two-phase locking is significance in the context of ensuring that schedules are serializable. The two-phase locking protocol defines a p

ERD, entity relationship diagram about finance

entity relationship diagram about finance

What is rdbms terminology for a row, What is RDBMS terminology for a row? ...

What is RDBMS terminology for a row? A tuple is a RDBMS terminology for a row

What are the technique to define a schema completely, What are the techniqu...

What are the technique to define a schema completely ? A schema is completely define by DDL and DML query language.

Explain candidate key, Explain Candidate key? Candidate Key - A candi...

Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.

How we can implement relationships when designing tables, You want to imple...

You want to implement following relationships when designing tables. How would you do it? a.) One-to-one b.) One-to-many c.) Many-to-many a.) One-to-One relationship -

On laod, how to write a in a text and load it on mysql

how to write a in a text and load it on mysql

Differentiate between b-tree and b+ tree, Differentiate between B-tree and ...

Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd