A distributed transaction, Database Management System

Assignment Help:

A Distributed Transaction

Let us demonstrate the concept of a distributed transaction by considering a banking system having of three branches located in 3 different cities. Every branch has its own computer with a database having of all the accounts maintained at that branch. Each such installation is therefore a site. There also exists one single site which preserves information about all the other branches of the bank. Assume that the database systems at the several sites are based on the relational model. Every branch preserves its portion of the relation: DEPOSIT (DEPOSIT-BRANCH) where DEPOSIT-BRANCH = (branch-name, customer-name, account-number, balance)

A site having information about the 4 branches maintains the relation branch- details, which has the schema as:

BRANCH-DETAILS (Financial_ health, branch-name, city)

There are other relations maintained at the several sites which are ignored for the purpose of our example.

A local transaction is a transaction that accesses accounts in only one single site, at which the transaction was started. A global transaction, on the other hand, is one which either accesses accounts in a site dissimilar from the one at which the transaction was started, or accesses accounts in various different sites. To demonstrate the difference among these two types of transactions, take the transaction to add Rs.5000 to account number 177 located at the Delhi branch. If the transaction was started at the Delhi branch, then it is considered local; or else, it is considered global. A transaction to transfer Rs.5000 from account 177 to account 305, which is located at the Bombay branch, is a global transaction as accounts in two dissimilar sites are accessed as a result of its implementation. A transaction finding the total financial standing of each branch is global.

What creates the above configuration a distributed database system are the facts that:

  • The several sites may be locally controlled yet are aware of each other.
  • Every site gives an environment for executing both global and local transactions.

Though, a user need not know whether on underlying application is distributed or not.


Related Discussions:- A distributed transaction

Memory components of sga, Problem 1. Describe the Oracle Architecture w...

Problem 1. Describe the Oracle Architecture with a neat labeled diagram, Also explain the individual components of the Architecture. 2. Write about the following Oracle 9i o

Difference between internal tables and extra datasets, What is the differen...

What is the difference between internal tables and extract datasets? The lines of an internal table always have the similar structure. By using extract datasets, you can ha

Er-diagram, courier company er-diagram

courier company er-diagram

Shadow paging, Describe the shadow paging technique.

Describe the shadow paging technique.

MANAGEMWNT OF PRINCILES AND TECHNIQUES., HOW TO SOLVE THE LP Problems by si...

HOW TO SOLVE THE LP Problems by simplex method?z=x1+-3x2+2x3

Define the canonical cover, Define the Canonical cover Ans: A canonical...

Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen

What are object interaction diagrams, What are object interaction diagrams?...

What are object interaction diagrams? Object interaction diagrams are the diagrams that used to describe order in which messages are communicated in execution of an operation,

Describes the several relationship constraints, Describes the several relat...

Describes the several relationship constraints through giving suitable example? Constraints on relationships: There are two kinds of constraints on relationships. 1) Mapping

Natural join-table handling, Natural Join : It is the similar like Equi joi...

Natural Join : It is the similar like Equi join except one of the duplicate columns is removed in the result table. The natural join is the most usually used form of join operation

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

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