The document discusses different concurrency control protocols in databases including lock-based protocols like two-phase locking and timestamp-based protocols like timestamp ordering. It explains how these protocols use locking and timestamps to ensure consistency across concurrent transactions. The document also promotes joining SQL database administration training in Pune to learn these concepts and build a career in the database field.

1. Learn about Concurrency Protocol in Oracle Certification Courses in
Pune
If you consider multiprogramming environment where various transactions work together
at the same time, it is vital to manage the concurrency of dealings.We have concurrency management methods to make sure atomicity, solitude, andserializability of contingency dealings.Concurrency management methods can be subdivided into two classes −Lock based protocolsTime stamp based protocolsLearn all these as there are many database jobs in pune for freshers.

2. Lock-based Protocols
Database techniques prepared with lock-basedmethods use a procedure by which any dealcannot read or edit data until it gets an proper lockon it.Locks are of two kinds −Binary Lock − A data item has a lock and it can bein two states; it is either locked or unlocked.Shared/exclusive − This type of lock distinguishesthe locks based on their uses. If a lock is obtainedon a data product to carry out write function, it is aunique lock.Enabling more than one deal to make on thesame data product would cause the data sourceinto an unreliable state.Read locks are shared because no data value isbeing modified.

3. Lock protocols are of 4 different types −Simplistic Lock Protocol
Simplistic lock-based methods enable dealings toget yourself a lock on every item before a ‘write’operation is conducted.After the completion of ‘write’ function, thetransactions may unlock the data item.Pre-claiming Lock ProtocolPre-claiming methods assess their functions andmake a list of items on which they need locks.Before starting a performance, the deal pre claimsthe locks it needs in advance. If all the locks areprovided, the deal carries out and unveils all thelocks when all its functions are over.If all the locks are not provided, the deal comesback and stays until all the locks are provided.

4. Two-Phase Lock 2PL
This locking method separates the performancestage of a deal into three areas.In the first aspect, when the deal begins to work, itlooks for authorization for the locks it needs.The second aspect is where the deal gets all thelocks.As soon as the deal releases its first lock, the thirdstage begins. In this stage, the deal cannotdemand any new locks; it only releases theobtained lock.Two-phase securing has two stages, onecontinues to grow, where all the tresses are beingobtained by the transaction; and the second stageis reducing, where the hair organised by the dealare developing.To declare a unique (write) lock, a deal must firstobtain a shared (read) lock and then update it to aunique lock.

5. Strict Two-Phase Locking
The first stage of Strict-2PL is same as 2PL. Afterobtaining all the lock in the first stage, the dealcarries on to operate normally.But contrary to 2PL, Strict-2PL does not to unveilslock after using it. Strict-2PL keeps all the lockuntil the commit point and unveils all the locks atone time.Timestamp-based ProtocolsThe most widely used concurrency method is thetimestamp centered method.This method uses either program time or logicalcounter as a timestamp.Lock-based methods handle the purchasebetween the inconsistent sets among dealings atthe period of performance, whereas timestamp-based methods begin being soon as a deal isdesigned.Every deal has a timestamp associated with it,and the purchasing will depend on the age of thedeal. A deal designed at 0002 time time would beover the age of all other dealings that come afterit.For example, any deal ‘y’ coming into the programat 0004 is 2 seconds young and the concernwould be given to the mature one.In inclusion, every data item is given the neweststudy and write-timestamp.This allows the program know when the last ‘readand write’ function was conducted on the dataitem.

6. Timestamp Ordering Protocol
The timestamp-ordering method guaranteesserializability among dealings in their inconsistentread and write functions.This holds to the method program that theinconsistent couple of projects should beimplemented according to the timestampprinciples of the dealings.The timestamp of deal Ti is denoted as TS(Ti).Read time-stamp of data-item X is denoted by R-timestamp(X).Write time-stamp of data-item X is denoted by W-timestamp(X).Timestamp purchasing method works as follows −If a deal Ti provides a read(X) function −

7. If TS(Ti) < W-timestamp(X)Operation refused.If TS(Ti) >= W-timestamp(X)Operation implemented.All data-item timestamps modified.If a deal Ti problems a write(X) function −If TS(Ti) < R-timestamp(X)Operation refused.If TS(Ti) < W-timestamp(X)Operation refused and Ti rolled back.Otherwise, function executed.

8. Thomas’ Write Rule
This concept declares if TS(Ti) < W-timestamp(X), then the procedure is refusedand Ti is rolled back.Time-stamp ordering rules can be customized for making the routine viewserializable.Instead of getting Ti rolled back, the ‘write’ function itself is ignored.You can join the sql dba training in Pune to make your career in this field.