Distributed transaction atomic-consistent-isolated, Database Management System

Assignment Help:

A distributed transaction consists of subtransactions that execute at different sites and access local DBMSs at those sites. For example, a distributed transaction that transfers money from a bank account at site A to a bank account at site B executes a subtransaction at A that does the withdrawal and then a subtransaction at B that does the deposit.

Such a distributed transaction must satisfy the ACID properties in a global sense: it must be globally atomic, isolated, consistent, and durable. The issue is, if the subtransactions at each site individually satisfy the ACID properties, does the distributed transaction necessarily satisfy the ACID properties? Certainly if the subtransactions at each site are individually durable, the distributed transaction is durable. Give examples of situations in which

(a)   The subtransactions at each site are atomic, but the distributed transaction is not atomic.

(b)   The subtransactions at each site are consistent, but the distributed transaction is not consistent.

(c)    The subtransactions at each site are isolated, but the distributed transaction is not isolated.

 

 


Related Discussions:- Distributed transaction atomic-consistent-isolated

Explain composite attribute in sql, Explain Composite attribute in SQL ? ...

Explain Composite attribute in SQL ? Composite attribute: A composite attribute has many components, each of that is atomic or composite.

Mixed fragmentation, Mixed fragmentation: Sometimes, horizontal fragmentati...

Mixed fragmentation: Sometimes, horizontal fragmentation or vertical fragmentation of a database schema by itself is insufficient to sufficiently distribute the data for some appli

What is meant by heuristic optimisation, What is meant by heuristic optimis...

What is meant by heuristic optimisation?  Discuss the main heuristics that are applied during query optimisation.  Ans:  In heuristic optimization, heuristics are employed to r

Data Warehousing Job Scheduling, 1) Define a job scheduling strategy that w...

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

What is candidate key, What is candidate key? Candidate Key - A candi...

What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.

What are the properties of transaction, What are the properties of transact...

What are the properties of transaction? There are three properties of transactions :- A)     Atomicity B)      Consistency C)       Isolation

Define weak and strong entity sets, Define weak and strong entity sets? ...

Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set: Entity set that

Convert the erd into its relevant relational schema, Question: Describe...

Question: Describe briefly the three parts of the Relational Model. (a) The term integrity refers to the accuracy or correctness of the data in the database. Define the fol

Explain the recoverable schedule, Explain the Recoverable Schedule A r...

Explain the Recoverable Schedule A recoverable schedule is one in which for each pair of transactions Ti and Tj such that Tj reads a data item formerly written by Ti, the comm

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