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

Develop motel point of sale software, Project Description: I need a poin...

Project Description: I need a point of sale for motels. It needs to run on windows and requires being network able so that we can have more than one computer using it at once.

ER diegrams, How to draw an ER diagram to a finance companz

How to draw an ER diagram to a finance companz

What is the role of order by clause, What is the role of ORDER By Clause? ...

What is the role of ORDER By Clause? ORDER BY clause: The ORDER BY clause permits you to sort the records in your result set. The ORDER BY clause can just be used in select s

Proposed information analysis, Add generation capabilities and/or tailor th...

Add generation capabilities and/or tailor the built-in functionality of generator. This enables you to produce "all" the test data for the MySQL tables you produced in the previous

Design an entity relation model, Funky Festivals Specification Funky Fe...

Funky Festivals Specification Funky Festivals organise music festivals which take place at various venues throughout the UK.  A venue needs to be booked before a Festival can t

Atomicity-transaction , Atomicity: It describes a transaction to be a one ...

Atomicity: It describes a transaction to be a one unit of processing. We can also say either a transaction will be finished completely or not at all. In the transaction example 1

Give the levels of data abstraction, Give the levels of data abstraction? ...

Give the levels of data abstraction? There are three levels of Data Abstraction a) Physical level b) logical level c) view level

Explain candidate key, Explain Candidate key? Candidate Key - A candi...

Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

Relational model, A model in database system mostly defines the organisatio...

A model in database system mostly defines the organisation of data or structure and a set of operations on that data. Relational model is a easy model in which database is represen

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