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

Define the query optimisation, Define the Query optimisation The query ...

Define the Query optimisation The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonica

What is a phantom deadlock, What is a Phantom Deadlock? In distributed...

What is a Phantom Deadlock? In distributed deadlock detection, the delay in propagating local information might cause the deadlock detection algorithms to recognize deadlocks

Define the concept of aggregation, Define the concept of aggregation.  Give...

Define the concept of aggregation.  Give two examples where this concept is useful. Ans: Aggregation transforms a relationship among the objects into a higher-level object. A

State the rearranging the execution order for efficiency, Define the step -...

Define the step - Rearranging the Execution Order for Efficiency As we know that algorithm and data structure are closely related to one another, but data structure is conside

Explain five duties of database administrator, Explain five duties of Datab...

Explain five duties of Database Administrator? 1. DBA administers the three stages of the database and, in consultation along with the whole user community, sets up an defin

Distributed transaction atomic-consistent-isolated, A distributed transacti...

A distributed transaction consists of subtransactions that execute at different sites and access local DBMSs at those sites. For example, a distributed transaction that transfers m

What is a recursive relationship, What is a recursive relationship? Give an...

What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER

What is deadlock, What is deadlock? Neither of the transaction can ever...

What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.

What is document scanning and imaging, What is document scanning and imagin...

What is document scanning and imaging? Document scanning and imaging, or digital archiving, is the method of scanning a document into a digital image to archive and retrieve a

Which language used in application programs for request data, Which languag...

Which language used in application programs to request data from the DBMS is referred? Language which is used in application program is DML to request data from the DBMS is ref

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