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

Query to delete constraint from alter table, A constraint named less_than_2...

A constraint named less_than_20 was defined on the field date_of_birth of table student. Delete this constraint. ALTER TABLE student DROP CONSTRAINT less_than_20;

In a hierarchical model of data records are organized, In a Hierarchical mo...

In a Hierarchical model of data records are organized ? In the hierarchical model of data records are organized as Tree structure.

Hoework, Farmer Bob, Farmer Jane and Farmer Jose run a cow farming co-op. ...

Farmer Bob, Farmer Jane and Farmer Jose run a cow farming co-op. For every cow they keep the cow’s name, age (or date of birth), breed and numbered plastic ear tag. The each of t

Indexed (indexed sequential) file organisation, Indexed (Indexed Sequential...

Indexed (Indexed Sequential) File Organisation It organises the file like a big dictionary, i.e., records are kept in order of the key but an index is stored which also allows

Develop a fragment of a hypothetical system, The objectives of this assignm...

The objectives of this assignment are:  - to develop skills in the design of database driven applications  - to develop skills in applying SQL to implement the relational and

What is indexed sequential file organization, What is indexed sequential fi...

What is indexed sequential file organization? What are the applications of this organization?  Ans: An index file can be employed to effectively overcome the problem of storing

Non-query optimisations, Part: Recommended (Non-query) Optimisations Thi...

Part: Recommended (Non-query) Optimisations This section entitled "Recommended (non-query) optimisations" should be a brief report containing recommended optimisations you would

Compute the closure set, Compute the closure (F+) for the following set of ...

Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

Type of views-data control, Type of views :  Simple views and Difficult ...

Type of views :  Simple views and Difficult Views Feature Simple Views Complex Views Number of tables One

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