Improved reliability, Database Management System

Improved Reliability:In a centralised DBMS, a server failure stops the operations of the DBMS. Though, a failure at single site of a DDBMS, or a failure of a communication link creation some sites inaccessible, does not make the whole system inoperable. Distributed DBMSs are designed to continue to function despite such as failures. In particular, if data are replicated in various sites, a transaction requiring a particular data item may find it at various sites. Therefore, the failure of a site does not necessarily imply the shutdown of the system.

The failure of one site must be identified by the system, and appropriate action may be required to recover from the failure. The system has no longer used the services of the failed site. At last, when the failed site recovers or is repaired, mechanisms have to be available to integrate it smoothly back into the system. The recovery from failure in distributed systems is much more difficult than in a centralised system.

 

Posted Date: 3/12/2013 5:54:49 AM | Location : United States







Related Discussions:- Improved reliability, Assignment Help, Ask Question on Improved reliability, Get Answer, Expert's Help, Improved reliability Discussions

Write discussion on Improved reliability
Your posts are moderated
Related Questions
a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.

What are the parts of SQL language? The SQL language has various parts: data - definitition language  Data manipulation language  View definition  Transaction contr

Primary index A primary index is a file that has a sorted series of records having two columns: a block address for that key field in the data file; and the ordering key field.

Explain query execution plan? - Optimizer available in SQL Server optimizes code to be effectively executed. - A query execution plan demonstrates how this optimizer would r

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

My cut off date is very soon in a Database subject and i dont know how to solve anything in it

Project Description: We have purchased facebook style chat software which we are using with our site. It is prepared in PHP but the rest of the site is developed asp.net. Iss

Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both

Define instance and schema? Instance: Collection of data stored in the data base at a certain moment is Schema: The overall design of the data base is known as the data base

i want notes on this topic