Explain optimistic locking and pessimistic locking, Database Management System

Assignment Help:

Explain the difference between optimistic locking and pessimistic locking.

Optimistic locking supposes no transaction conflict will occur and deals with the consequences if it does. Pessimistic locking supposes that conflict will occur and so stops it ahead of time with locks. In general, optimistic locking is preferred for the Internet and for many intranet applications.

 


Related Discussions:- Explain optimistic locking and pessimistic locking

What are the constituents of file, What are the Constituents of File? Also ...

What are the Constituents of File? Also elaborates all the possible file operations? A file is organised logically as sequence of record. These records are mapped onto disk blo

What are the advantages of embedded query language, What are the advantages...

What are the advantages of embedded query language? Give an example of an embedded SQL query. Embedded query language - SQL could be implemented within two ways. It can be us

Define deadlock avoidance, Define Deadlock avoidance These protocols a...

Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I

Views-data control, Views A view is like a window by which data from ta...

Views A view is like a window by which data from tables can be changed or viewed. The table on which a view is based is known as Base table. The view is stored as a SELECT stat

What is a heterogeneous distributed database, What is a heterogeneous distr...

What is a heterogeneous distributed database? In a heterogeneous distributed database, dissimilar sites may use different schemas, and dissimilar dbms s/w. The sites may not be

What are the purpose for having variable length records, What are the purpo...

What are the purpose for having variable length records? What kinds of separator characters are required for each? Variable-Length Records - Variable-length records are thos

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

Equi join-table handling, Equi Join: A join in which the joining condition...

Equi Join: A join in which the joining condition is based on equality among values in the common columns. Common columns show (redundantly) in the result table. Let us Consider th

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