A step-wise distributed database design methodology, Database Management System

Assignment Help:

A step-wise distributed database design methodology

Following is a step-wise methodology for distributed database design.

(1) Examine the nature of distribution. Find out whether an organisation requires having a database at each branch office, or in every city, or possibly at a regional level. It has direct implication from the viewpoint of  fragmentation.   For example, in case database is needed at each branch office, the relations may fragment on the basis of branch number.

(2) Create a detailed global E-R diagram, if so needed and classify relations from entities.

(3) Analyse the most significant transactions in the system and classify where horizontal or vertical fragmentation may be desirable and helpful.

(4) Classify the relations that are not to be fragmented. Such relations will be replicated everywhere. From the global ER diagram, eliminate the relations that are not going to be fragmented.

(5) Study the relations that are on one-side of a relationship and choose a suitable fragmentation schema for these relations. Relations on the many-side of a relationship might be the candidates for derived fragmentation.

(6)  During the earlier step, check for situations where either vertical or mixed fragmentation would be required, that is, where the transactions need access to a subset of the attributes of a relation.

 


Related Discussions:- A step-wise distributed database design methodology

Create a view containing name and number of department, Create a view emp_d...

Create a view emp_dep containing e_name and number of dependents from the tables employee and dependent of (i) CREATE VIEW emp_dept AS SELECT ename, COUNT(*) FROM employee, dep

Describe data manipulation language, Describe Data Manipulation language ? ...

Describe Data Manipulation language ? Data Manipulation Language (DML) - A data manipulation language is a language which enables users to access or manipulate data as organize

Define deadlock term, a. Define the term "deadlock". There are four conditi...

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.

Explain pipelining, Explain pipelining.        Ans: In order to describ...

Explain pipelining.        Ans: In order to describe pipelining in simple terms, think of it as breaking down processor functions into smaller and smaller parts. For instance,

Explain interfaces for parametric users, Explain Interfaces for parametric ...

Explain Interfaces for parametric Users? Interfaces for Parametric Users - Parametric users, such as bank tellers, frequent have a little set of operations in which they must p

Although how will the system recover, Although how will the system recover ...

Although how will the system recover The selection of REDO or UNDO for a transaction for the recovery is completed on the basis of the state of the transactions. This state is

Queries, Find the names of all Albums that have more than 30 tracks. Result...

Find the names of all Albums that have more than 30 tracks. Result: (name: varchar(255))

What is index, What is Index? An index is a physical structure having p...

What is Index? An index is a physical structure having pointers to the data. Indices are created in an existing table to locate rows more quickly and efficiently. It is possibl

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