Learn about Concurrency Protocol in Oracle Certification Courses in Pune

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, and serializability of
  contingency dealings.

2
Lock-based Protocols

• Database techniques prepared with lock-based
  methods use a procedure by which any deal cannot
  read or edit data until it gets an proper lock on
  it.
• Locks are of two kinds -
• Binary Lock - A data item has a lock and it can
  be in two states it is either locked or
  unlocked.
• Shared/exclusive - This type of lock
  distinguishes the locks based on their uses. If a
  lock is obtained on a data product to carry out
  write function, it is a unique lock.

3
Lock Protocols are of 4 Different Types

• 1) Simplistic Lock Protocol
• Simplistic lock-based methods enable dealings to
  get yourself a lock on every item before a
  write operation is conducted.
• After the completion of write function, the
  transactions may unlock the data item.

4

• 2) Pre-claiming Lock Protocol
• Pre-claiming methods assess their functions and
  make a list of items on which they need locks.
• Before starting a performance, the deal pre
  claims the locks it needs in advance. If all the
  locks are provided, the deal carries out and
  unveils all the locks when all its functions are
  over.

5

• 3) Two-Phase Lock 2PL
• This locking method separates the performance
  stage of a deal into three areas.
• In the first aspect, when the deal begins to
  work, it looks for authorization for the locks it
  needs.

6

• 4) Strict Two-Phase Locking
• The first stage of Strict-2PL is same as 2PL.
  After obtaining all the lock in the first stage,
  the deal carries on to operate normally.
• But contrary to 2PL, Strict-2PL does not to
  unveils lock after using it. Strict-2PL keeps all
  the lock until the commit point and unveils all
  the locks at one time.

7
Timestamp-based Protocols

• The most widely used concurrency method is the
  timestamp centered method.
• This method uses either program time or logical
  counter as a timestamp.
• Lock-based methods handle the purchase between
  the inconsistent sets among dealings at the
  period of performance, whereas timestamp-based
  methods begin being soon as a deal is designed.

8
Timestamp Ordering Protocol

• The timestamp-ordering method guarantees
  serializability among dealings in their
  inconsistent read and write functions.
• This holds to the method program that the
  inconsistent couple of projects should be
  implemented according to the timestamp principles
  of the dealings.
• The timestamp of deal Ti is denoted as TS(Ti).

9
Thomas Write Rule

• This concept declares if TS(Ti) lt W-timestamp(X),
  then the procedure is refused and Ti is rolled
  back.
• Time-stamp ordering rules can be customized for
  making the routine view serializable.
• 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.