Evaluation Modelling with Concurrency In Database Management via Some Algorithms

Run concurrent transactions in a database management system may result in inconsistency. Inconsistency is as the result of incorrect values that is created for data available as a result of conflict and interference in running transactions. Concurrency control algorithms to ensure concurrent running of multiple transactions are designed that work concurrently with shared data. A great deal of research has been done in the field of database concurrency control, which results in various concurrency control algorithms. A lot of studies can been done in the area of evaluating concurrency control algorithms due to various algorithms in this area and the fact that its importance will increase day by day. the colored Petri Net have high modeling capabilities and one of the best ways to analyze the concurrency control mechanisms. In this paper, firstly basic two-stage locking concurrency control algorithms as well as techniques of wound - wait and wait - die modeled that including the techniques of preventing deadlock