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

Which is an advantage of view, Which is an advantage of view? The Advan...

Which is an advantage of view? The Advantages of view is Data security, Derived columns and Hiding of complex queries

Define instance and schema, Define instance and schema? Instance: Colle...

Define instance and schema? Instance: Collection of data stored in the data base at a certain moment is Schema: The overall design of the data base is known as the data base

RDBMS, what is RDBMS? how it works? good example.

what is RDBMS? how it works? good example.

What are the problems in database normalization, What are the problems if o...

What are the problems if one were not to normalize?  When do these problems surface?           Ans:  Database normalization, sometimes considered to as  canonical synthesis, is

Which operations need the participating relations to union, Which operation...

Which operations need the participating relations to be union compatible? A UNION, INTERSECTION and DIFFERENCE operations need the participating relations to be union compatibl

Read-set(t) and timestamps-optimistic concurrency contents, read-set(T) : E...

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.

Explain key benefits of a content management system, Question: (a) What...

Question: (a) What do you meant by content management and briefly describe four major components of a Content Management System? (b) Explain key benefits of a Content Manage

Define the wait for graph, Define the Wait for graph Ans: The wait-for-...

Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap

Queries, Find the names of all Albums that have more than 30 tracks. Result...

Find the names of all Albums that have more than 30 tracks. Result: (name: varchar(255))

Concurrent transactions-backup and recovery, Representing complex relations...

Representing complex relationship among data A database may contain varieties of data interrelated to each other in numerous ways. A DBMS must have the capability to represent

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