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

What is the use of group by clause, What is the use of group by clause? ...

What is the use of group by clause? Group by clause is used to be relevant aggregate functions to a set of tuples. The attributes given in the group by clause are used to shape

The structured query language, The Structured Query Language INTRODUCT...

The Structured Query Language INTRODUCTION Database is an organised set of information about an entity having controlled redundancy and serves numerous applications. DBMS

Lossless-join decomposition, Lossless-Join Decomposition   Let us sh...

Lossless-Join Decomposition   Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r

Define outer union operation of the relational algebra, Define outer union ...

Define outer union operation of the relational algebra. Compute the outer union for the relations R and S given below. Outer Join - If there are any values in one tabl

Er schema can be represented by relation schemas , Q. Describe how an ER sc...

Q. Describe how an ER schema can be represented by relation schemas and constraints arising from ER design can be mapped to constraints on a relation schema.     The entity rela

Economics, Economics: It is now usually accepted that it costs less to make...

Economics: It is now usually accepted that it costs less to make a system of smaller computers with the equivalent power of a one large computer. It is more cost-effective to get s

ER Diagram, Soccer player ER Diagram to Relational database schema

Soccer player ER Diagram to Relational database schema

Advantages of database systems, Problem 1. Describe the following a)...

Problem 1. Describe the following a) Advantages of Database Systems b) Functions of a DBMS Explanation of part (a) and (b) 2. Explain the following concepts w

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