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

ERD, A student entity type has the following attributes,name..

A student entity type has the following attributes,name..

Define the term- control as state within program, Control as State within P...

Control as State within Program 1.  The term control exactly means to check effect of input within a program. For illustration, in Figure, after the ATM card is inserted (a

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

What are wait-for-graphs, What are wait-for-graphs?Give the algorithm to co...

What are wait-for-graphs?Give the algorithm to construct a wait-for-graph from a given schedule of transactions? How can deadlocks be detected from wait-for-graphs?   Ans:  The

Give the relational calculus queries of players in sql, An orchestra databa...

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

Give the general form of sql query, Give the general form of SQL query? ...

Give the general form of SQL query? Select  A1, A2............., An From  R1, R2..............., Rm Where  P

Need for multiple access paths, Need for Multiple Access Paths In pract...

Need for Multiple Access Paths In practice, most of the online information systems need the support of multi-key files. For example, consider a banking database application hav

How many levels can be viewed architecture of the database, How many levels...

How many levels can be viewed in Architecture of the database ? Architecture of the database can be viewed as three levels.

Explain the outer join, Define Outer join Outer join - If there are any...

Define Outer join Outer join - If there are any type of values in the one table that do not have corresponding value(s) in the other, in an equi-join which will not be selected

Attribute, a set of possible data value of an attribute is called??

a set of possible data value of an attribute is called??

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