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

Describe the algorithm to draw the dependency graph, Describe the algorithm...

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

The external or view level in dbms, The External or View Level The ex...

The External or View Level The external or view level is the highest level of abstraction of database. It gives a window on the conceptual view, which permits the user to see

Describe data manipulation language, Describe Data Manipulation language ? ...

Describe Data Manipulation language ? Data Manipulation Language (DML) - A data manipulation language is a language which enables users to access or manipulate data as organize

Task partitioning, Task Partitioning, Sequencing and Project Planning T...

Task Partitioning, Sequencing and Project Planning The tasks required for the service might be broadly partitioned into: 0.      Set up database tables and account file

Can a filed occur in several field groups, Can a filed occur in several fie...

Can a filed occur in several field groups. Yes.  But it leads to redundant data redundancy.

What are the various properties of relational tables, What are the various ...

What are the various properties of Relational tables? Relational tables have 6 properties: 1. Each row is unique. 2. Column values are of the same kind. 3. Values are

What are the uses of odbc, What are the uses of ODBC? Under what circumstan...

What are the uses of ODBC? Under what circumstances we use this technology? ODBC expose database capabilities within a standardized way to the application programmer by an ap

Computing the closure of a set of functional dependency, What is meant by c...

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

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