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

Calculate the joint probability, Consider the following frequency counts o...

Consider the following frequency counts of some itemsets in a transaction database r : freq({A}, r) = 0.405 freq({B}, r) = 0.510 freq({C}, r) = 0.303 freq({A

Log based recovery, Log based recovery: Let us first describe the term tran...

Log based recovery: Let us first describe the term transaction log in the context of DBMS. A transaction log is a record in DBMS that remains track of all the transactions of a dat

Database tables design and test queries, Load sample data into the database...

Load sample data into the database tables design and test queries to return the following information • All rows and columns for employees • All rows and columns for customers •

List and describe the different types of indexes, Question 1 Indexes are o...

Question 1 Indexes are ocasionally defines on a single field of a file called an indexing field. List and describe the different types of indexes Question 2 Consider a book i

Thid, describe objectivde of file organisation

describe objectivde of file organisation

Compare the two log based recovery schemes, Compare the two log-based recov...

Compare the two log-based recovery schemes in terms of ease of implementation and overhead cost.    Ans:  There are two types of log based recovery techniques: deferred update

What is predictive modelling, Problem: (a) Data mining is one of the b...

Problem: (a) Data mining is one of the best ways to analyse data and using software techniques, hidden and unexpected patterns and relationships in sets of data can be extrac

Durability-transaction , Durability : This property necessitates that once ...

Durability : This property necessitates that once a transaction has committed, the changes made by it be never lost because of subsequent failure. Thus, a transaction is also a bas

Eliminate repeating groups, Eliminate Repeating Groups The problem is, ...

Eliminate Repeating Groups The problem is, "Find out the list of employees, who knows DB2". For this problem we require to perform an awkward scan of the list looking for re

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