Read-set(t) and timestamps-optimistic concurrency contents, Database Management System

  • read-set(T): Each data items that are read by a transaction T
  • Timestamps: for all transaction T, the start-time and the end time are reserved for all the three phases.

Let us show this scheme here with the help of the following examples:

Consider the set for transaction T1 and T2.

T1

T2

Phase

Operation

Phase

Operation

-

-

Read

Reads the read set (T2). Let say variables X and Y and

performs updating of local values

Read

Reads the read set (T1) lets

say variable X and Y and performs updating of local values

-

-

Validate

Validate the values of (T1)

-

-

-

-

Validate

Validate the values of (T2)

Write

Write the updated values in

the database and commit

-

-

-

-

Write

Write the updated values in the

database and commit

In this given instance both T1 and T2 get committed. Please note that Read set of T1 and Read Set of T2 are both disjoint, also the Write sets are also disjoint and therefore no concurrency related problem can happen.

T1

T2

T3

Operation

Operation

Operation

Read R(A)

--

--

--

Read R(A)

--

--

--

Read (D)

--

--

Update(D)

--

--

Update (A)

 

--

 

--

Validate (D,A) finds OK

Write (D,A), COMMIT

 

--

Validate(A):Unsuccessful

Value changed by T3

 

--

Validate(A):Unsuccessful

Value changed by T3

 

--

 

--

ABORT T1

--

--

--

Abort T2

--

In this scheme both T1 and T2 get aborted as they fail during validate phase whereas only T3 is committed. Optimistic concurrency control performs its checking at the transaction commits point in a validation phase. The serialization order is defined by the time of transaction validation phase.

Posted Date: 3/12/2013 3:14:45 AM | Location : United States







Related Discussions:- Read-set(t) and timestamps-optimistic concurrency contents, Assignment Help, Ask Question on Read-set(t) and timestamps-optimistic concurrency contents, Get Answer, Expert's Help, Read-set(t) and timestamps-optimistic concurrency contents Discussions

Write discussion on Read-set(t) and timestamps-optimistic concurrency contents
Your posts are moderated
Related Questions
Differentiate between natural join and outer join? Natural join is a binary operator which is written as (R * S) where as R and S are relations. The output of the natural join

Creation of Indexes Automatically: When a primary key or Unique constraint is show in a table definition then a unique index is formed automatically. Manually: User can


1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

What is a value? A data value is used for identity. This form of identity is used in relational systems.eg: The primary key value of a tuple recognize the tuple.

Consider the following six relation schemes and their corresponding sets of functional dependencies. In each case identify a. All the candidate keys b. The highest normal for

Project Description: Oracle Certified Professional with 20 years of practice, Oracle version 6.0.34, 7.3, 8.0, 8i, 9i, 10G, 11G, 12C. Crossplatform migration, Informix, MSSql

Let us now make the E-R diagram for the student database as per the explanation given in the previous section. We can also states the overall logical structure of a database usi

Architectural standard: Designation : Architect , Consultant Job Profile : As a part of Oracle Fusion Middleware at Satyam, I am involved with Presales, Delivery, A