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

What is null, What is NULL? Simply NULL means not in value.

What is NULL? Simply NULL means not in value.

Insert - referential integrity, The insertion of a tuple in the aim of refe...

The insertion of a tuple in the aim of reference does not cause any destruction. Though, insertion of a tuple in the relation in which, we has the foreign key, for instance, in ASS

Database security, Ask questiwhat is row indicator in database on #Minimum...

Ask questiwhat is row indicator in database on #Minimum 100 words accepted#

Explain the integrity constraints, Explain the integrity constraints: Not N...

Explain the integrity constraints: Not Null,  Unique, Primary Key with an example each. Is the combination 'Not Null, Primary Key' a valid combination. Justify. Not Null - Shou

#title., losers with new information systems

losers with new information systems

Benefits and drawbacks of heap files, Benefits of heap files 1.   This i...

Benefits of heap files 1.   This is a easy file Organisation method. 2.   Insertion is somehow capable. 3.   Good for bulk-loading data into a table. 4.   Best if file

What is persistency, What is persistency? Persistency ensures which dat...

What is persistency? Persistency ensures which data is stored and that after the object is no longer available (program stops running) the data will be available to other users

Give short note on the following terms- dirty pages and etl, Give short not...

Give short note on the following terms:Dirty pages and ETL a.) Dirty pages. These are buffer pages which comprise modifications which haven't been written to disk. b.

What is meant by buffer blocks and disk buffer, What is meant by buffer blo...

What is meant by buffer blocks and disk buffer   The blocks residing temporarily in main memory are referred to as buffer blocks. The area of memory where blocks reside t

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