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

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.


Posted Date: 3/13/2013 8:47:42 AM | Location : United States

Related Discussions:- A step-wise distributed database design methodology, Assignment Help, Ask Question on A step-wise distributed database design methodology, Get Answer, Expert's Help, A step-wise distributed database design methodology Discussions

Write discussion on A step-wise distributed database design methodology
Your posts are moderated
Related Questions
The database files accept the actual data and are typically the biggest in size. Depending on their shape, the tables for all the user operation can go in one database file-but

Extend your CREATE TABLE statement from problem 3 with referential integrity constraints. Updates and deletes on related rows are restricted. 6. From examination of the sample data

I need an ERD created for any original database(can be on anything). It needs to be 3NF. I then need all the CREATE STATEMENTS, INSERT STATEMENTS(anything you can think of as long

Determine Which is not a consequence of concurrent operations? Ans: Update anomaly.

For each 1: n relationship type R involving two entities E1 and E2, we recognize the entity type (say E1) at the n-side of the relationship type R and contain primary key of the en

How can Redundant Associations be done It can be done by asking questions: i)  Is there a specific arrangement of network which would optimize critical aspects of completed

Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

What is Data dictionary? A data dictionary is a reserved space in a database that is employed to store information about the database itself. A data dictionary may consist o

Question: (a) Use the following business rules to produce the E-R diagram. You should clearly show all the minimum and maximum cardinality constraint on each side of the relati

Data Scrubbing 70,000 records Project Description: We need services of a developer competent in data cleansing/Data scrubbing. Scope: - 70,000 records in CSV format.