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

Inconsistent analysis-problems of concurrent transactions, Inconsistent Ana...

Inconsistent Analysis : The problem as given with transactions T1 and T2 where two transactions interleave to make incorrect result during an analysis by Audit is the instance of s

Example on relational database schema, Question: The following relation...

Question: The following relational database schema corresponds to a part of a database used by the Registry Department of a university. DEPARTMENT (d#, d-name, head-of-dept)

What is data independence, What is data independence? Data Independenc...

What is data independence? Data Independence: Techniques which permit data to be changed without affecting the applications in which procedure it. There are two types of data

What is the concurrency identification, Concurrency Identification Whi...

Concurrency Identification While designing analysis, model we map real world model into our analytical model. Real life objects are simultaneous in nature, but all the design

What functions does a data dictionary perform, What functions does a data d...

What functions does a data dictionary perform? In a (DBMS)data management system, the principal functions performed by the data dictionary are Management of data defini

Database, real life situations where database management system are most su...

real life situations where database management system are most suitable

Example of primary key, Suppose that in an organisation, an employee may do...

Suppose that in an organisation, an employee may do different roles in dissimilar projects. Say, RAM is doing coding in one project and doing designing in another. Suppose that the

Keys - relational database integrity, Candidate Key:  In a relation R, a ca...

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

Checkpoint, what is check point in database management system

what is check point in database management system

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