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

Give the reasons for allowing concurrency, Give the reasons for allowing co...

Give the reasons for allowing concurrency? The reasons for allowing concurrency is if the transactions run serially, a short transaction might have to wait for a preceding long

Need customer management program, Project Description: This is a Custome...

Project Description: This is a Customer Management project. Customer data is presented in a text file. The program can load this text data into its database columns. The data ma

N-ary relationship, For every n-ary relationship type R where n>2, we make ...

For every n-ary relationship type R where n>2, we make a new table S to represent R. We contain as foreign key attributes in s the primary keys of the relations that show the parti

Explain about data independence, Data Independence This brings us to ou...

Data Independence This brings us to our next topic: data independence. It is the property of the database which tries to make sure that if we make any change in any level of sc

Types of attributes, Attributes attached to an entity can be of various typ...

Attributes attached to an entity can be of various types. Simple The attribute that cannot be further separated into smaller parts and shows the basic meaning is known as a

Marketing interface, as a customer service employee explain five measures y...

as a customer service employee explain five measures you would recommend to make even a displeased students patronize the school canteen

Set difference, Set Difference If R1 and R2 are two union compatible re...

Set Difference If R1 and R2 are two union compatible relations or relations then result of R3 =R1- R2 is the relation that have only those tuples that are in R1 but not in R2.

Explain the internal architecture of 8086, Problem 1. Write an assembly...

Problem 1. Write an assembly program to find the smallest among two numbers Writing an assembly program to find the smallest among two numbers 2. Explain the intern

Database design, Why is database design important?

Why is database design important?

Relational database model, diagrams and meaning

diagrams and meaning

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages