Structure of distributed database, Database Management System

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.

Posted Date: 3/12/2013 5:50:51 AM | Location : United States







Related Discussions:- Structure of distributed database, Assignment Help, Ask Question on Structure of distributed database, Get Answer, Expert's Help, Structure of distributed database Discussions

Write discussion on Structure of distributed database
Your posts are moderated
Related Questions
Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

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

Data Scrubbing 70,000 records Project Description: We need services of a developer competent in data cleansing/Data scrubbing. Scope: - 70,000 records in CSV format.

Order by clause By using this rows can be sorted It is used in the last portion of select statement By default it gets ascending order DESC: is used

What is the main goal of RAID technology? Describe the levels 1 through 5. RAID stands for Redundant Array of Inexpensive (or sometimes "Independent")Disks. RAID is a met

I want a script that will run, and update my virtual machine's LAN settings (proxy server and port), and also re-configure the Firefox User Agent. I want a script that will run,

Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap

Hardware failure :  Hardware failures are the failures when some disk or hardware chip fails. This may result in loss of data. One such trouble can be that a disk gets damaged and

Submit the SQL Statements necessary to create your database according to the following guidelines: Your SQL statements should exactly mirror your ERD. All primary keys,

The participation Constraints shows whether the existence of an entity depends on its being associated to another entity by the relationship type. There are two kinds of participat