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

Assignment Help:
  • 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.


Related Discussions:- Read-set(t) and timestamps-optimistic concurrency contents

Explain the hierarchical database model, Problem: (a) Briefly explain t...

Problem: (a) Briefly explain the ‘Hierarchical Database Model' using appropriate diagram. (b) List and briefly describe five potential benefits of the database approach comp

Illustrate the diagram - association as a cache, Association as a cache ...

Association as a cache This association must be updated when any new element is added to it, but testing for overlap using association is more efficient.    Figure:

By which techniquestransaction processing is associated, By which technique...

By which techniquesTransaction processing is associated? Transaction processing is associated by producing detail, summary, or exception reports and recording a business activi

Why do so various organizations use mysql, Why do so various organizations ...

Why do so various organizations use MySQL? Advantages: Open source Highly efficient Offers a high scalability in terms of size and connectivity. Highly prote

What is candidate key, What is Candidate Key Super Key or Candidate Ke...

What is Candidate Key Super Key or Candidate Key: It is such an attribute of a table that can uniquely recognize a row in a table. Generally they have unique values and can n

Inconsistent analysis-problems of concurrent transactions, Inconsistent Ana...

Inconsistent Analysis : The problem as given with transactions T1 and T2 where two transactions interleave to make incorrect result during an analysis by Audit is the instance of s

Union - basic set operation, UNION If R1 and R2 are two union compatibl...

UNION If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both. In case, R3 will have tuples

HIT, Meaningful use refers to the use of certified EHR technology to "enhan...

Meaningful use refers to the use of certified EHR technology to "enhance quality, efficiency, and reduce health disparities

Explain the term- collation, What is Collation Collation is a kind of ...

What is Collation Collation is a kind of sort order. There are majorly 3 types of sort orders, namely: i.) Dictionary case insensitive ii.)Dictionary - case sensitive

Improved performance, Improved performance: As the data is located near the...

Improved performance: As the data is located near the site of its demand, and given the inherent parallelism because of multiple copies, speed of database access may be good for di

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd