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

Difference between clustered and a non-clustered index, What are the differ...

What are the difference between clustered and a non-clustered index? A clustered index is a special type of index that reorders the way records in the table are physically stor

Maping constraits, #question.what is mapping constraints and types?.

#question.what is mapping constraints and types?.

Enhanced entity relationship, what do you understand by enhanced entity-rel...

what do you understand by enhanced entity-relationship

What creates while a primary key is combined with a foreign, What it create...

What it creates while a primary key is combined with a foreign key? It creates Parent-Child relation ship between the tables that connect them while a primary key is combined w

Define the term- making common behaviour abstract, Making Common Behaviour ...

Making Common Behaviour Abstract Let us define abstraction "Abstraction means to focus on the necessary, inherent aspects of an entity and ignoring its accidental features". O

Keys - relational database integrity, Candidate Key:  In a relation R, a ca...

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

Define check point and its impact on data base recovery, Define check point...

Define check point and its impact on data base recovery.                  Ans:  There could be hundreds of transactions handled per minute, in a large on-line database system.

What are costs to be considere when transaction is roll back, What are the ...

What are the costs to be considered when a transaction has to be rolled back when recovering from deadlock?         Ans: A few transaction will must rolled back (made a victim)

Data fragmentation-use of partial data by applications, Use of partial data...

Use of partial data by applications : In common, applications work with views rather than whole relations. Thus, it may be more appropriate to work with subsets of relations rather

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