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
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,


What kind of advantages to copying records from one table to another? -) When an algorithm that modifies a table is used after that it's safer to work with the copy -) When

Create table employee and enter employee data in SQL? Consider the following relational schemas: EMPLOYEE (EMPLOYEE_NAME, STREET, CITY) WORKS (EMPLOYEE_NAME, COMPANYNAME, SAL

Define Deadlock recovery measures                   To recover from deadlock, the cycle in the wait-for-graph should be broken. The common technique of doing this is to rollbac

Sub query in the UPDATE command : Example :  //Double  the  commission  for  employees,  who  have  got  at  least  2 increments. UPDATE EMP SET COMM = COMM * 2 WHERE

An orchestra database consists of the following relations: CONDUCTS (conductor, composition) REQUIRES (composition, Instrument) PLAYS (Player, Instrument) Give the relational

What is OLAP? OnLine Analytical Processing (OLAP) is a Business Intelligence (BI) reporting system. OLAP gives the user with the capability to sum, count, average and do other

What is catalog in DBMS? Catalog - A relational DBMS maintains information about every table and index in which it contains. A catalog is a collection of special tables that st

Define outer union operation of the relational algebra. Compute the outer union for the relations R and S given below. Outer Join - If there are any values in one tabl