Structure of distributed database, Database Management System

Assignment Help:

Structure Of Distributed Database: A distributed database system haves of a collection of sites, each of which keeps a local databases system. Every site is able to process local transactions, the transactions that access data only in that one site. In addition, a site may participate in the implementation of global transactions, those transactions that access data at various sites.

The execution of global transactions on the distributed architecture needs communication between the sites. Figure illustrates a representative distributed database system architecture having transactions. Please note that both the transactions shown are global in nature as they need data from both the sites.

                    2207_Structure Of Distributed Database.png

                                   Figure: Distributed Database Schema and Transactions

   Some of the key issues including DDBMS are:

  • How the data is distributed?
  • Is this data distribution unseen from the general users?
  • How are the integration of data and its control including security managed globally and locally?
  • How are the distributed database related?

The sites in a distributed system can be related physically in a variety of ways. The several topologies are represented as graphs whose nodes correspond to sites. An edge from node A to node B communicates to a direct connection among the two sites.

Some of the most common connection structures are depicted in Figure. The main differences between these configurations involve:

  • Installation cost. The cost of physically connecting the sites in the system
  • Communication cost. The cost in time and money to send a message through site A to site B.
  • Reliability. The frequency with which a site or link fails.
  • Availability. The degree to which data can be accessed despite failure of some links or sites.

These differences play an vital role in choosing the appropriate mechanism for handling the distribution of data The sites of a distributed database system may be distributed physically either over a huge geographical area (such as all over India), or a small geographical area such as a one building or a number of adjacent buildings). The former type of network is based on broad area network, whereas the latter uses local-area network.


Related Discussions:- Structure of distributed database

Chapter 1 - Profile for the Organization, Chapter 1 - Profile for the Organ...

Chapter 1 - Profile for the Organization You have to select an organization of your choice and assume that you work for that organization. Now you must prepare a brief profile of t

Linked list, what is difference between circular inked lust and grunded lin...

what is difference between circular inked lust and grunded linked list

Explain naivebayessimple algorithem, Use the IRIS dataset that comes with W...

Use the IRIS dataset that comes with Weka to compare the classification performance of the following algorithms. 1. NaiveBayesSimple 2. MultiLayerPerceptron J48 (

Database application development, The database application project (DAP) fo...

The database application project (DAP) for this assignment consists of the creation of a fully functional Microsoft Access database application for a real client. I recommend you s

What is hash file organization, What is hash file organization? What are t...

What is hash file organization? What are the causes of bucket overflow within a hash file organization? What can be completed to decrease the occurrence of bucket overflow?

State about the advance object design, ADVANCE OBJECT DESIGN Introduct...

ADVANCE OBJECT DESIGN Introduction Analysis is the initial step of the OMT methodology. It is apprehensive with devising a precise, concise, correct and understandable mo

Er digrams, what is er digram given that example of hospital,bank and libra...

what is er digram given that example of hospital,bank and library er digram.

Logical operators-logical operators, Logical Operators Rules of Preced...

Logical Operators Rules of Precedence: Order evaluated Operator 1 All comparison operators 2

Entity integrity constraint - relational constraints, It defines that no pr...

It defines that no primary key value can be null. This is as the primary key is used to recognize individual tuple in the relation. So we will not be able to recognize the records

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