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

Physical location of record is determined by which formula, The physical lo...

The physical location of a record is determined by which mathematical formula that transforms a file key into a record location? The physical location of a record is determined

How are tables stored on disk?, How are tables stored on Disk? We reali...

How are tables stored on Disk? We realise that every record of a table can have different amounts of data. This is due to in some records; some attribute values may be "zero".

How is concurrency identified, How is concurrency identified? Concurren...

How is concurrency identified? Concurrency in objects can be identified by the way they alter their state. Current objects can change their state independently. Aggregation imp

Write short notes on data ware housing, Write short notes on data ware hous...

Write short notes on data ware housing? Data ware housing applications needs the transformation of data from many sources into a cohesive reliable step set of data configured a

What way a particular application views data from database, What is the way...

What is the way a particular application views the data from the database that the application uses? Sub schema is the way a particular application views the data from the data

Identify the critical activities, Consider a systems development project wi...

Consider a systems development project with the following data Activity                                Duration (weeks)        Precedence Relationship 1. Software design

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Transaction states, The following variant of the primary copy asynchronous-...

The following variant of the primary copy asynchronous-update replication protocol has been proposed for totally replicated systems. (a)  A transaction executing at site A updat

Horizontal Fragmentation, I want to fragment existing table using java code...

I want to fragment existing table using java code... help me..!!

Weak entity, Entity types that do not have any key attribute, and therefore...

Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by

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