• ONUNGWE, HELEN. O
• Eke Bathlomeh o.
• Alabi olumide A.

Concurrency is a situation where more than one processes are running at the same time. In such scenarios, there are tendencies that there will be conflict in reading and writing of data items Concurrency is associated with four major problems (P1 – P4): Unrepeated Read (P1), Inconsistent Analysis (P2), Lost Update (P3) and Phantom Read (P4). A Concurrency Control techniques need to be put in place to ensure that data items are serialize in a structured pattern to avoid an adverse compromise on data integrity and consistency. Basically, there are two major techniques of controlling Concurrency on Databases; Pessimistic and Optimistic Control techniques. This paper is aimed at handling the lost update problem (P3) using the Optimistic technique. We used Optimistic Locking System to insert locks on the data items. The locks were only released when the first transaction had reached it’s commit stage in order to prevent data duplication. Our Optimistic Locking approach used the locks only at the beginning of the transaction. Optimistic locking was proven to be the best choice in a situation where if the odds of conflict are very low (many records and relatively few users, or very few updates and mostly ”read” operations),

KEYWORDS: Optimistic, Lost Update, Concurrency, Concurrency Control, Serialisation, Database, Locks etc

"CONCURRENCY INSIGHT: OPTIMISTIC PARADIGM ON LOST UPDATE TRANSACTIONS IN A DISTRIBUTED DATABASE", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.9, Issue 3, page no.a131-a140, March-2022, Available :http://www.jetir.org/papers/JETIR2203017.pdf

"CONCURRENCY INSIGHT: OPTIMISTIC PARADIGM ON LOST UPDATE TRANSACTIONS IN A DISTRIBUTED DATABASE", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.9, Issue 3, page no. ppa131-a140, March-2022, Available at : http://www.jetir.org/papers/JETIR2203017.pdf