Logical database design, Data Structure & Algorithms

1. For the ER diagram you created in assignment, the artefact of the conceptual database design, map the ER model into the relational model according to how it was designed in the ER diagram. You may however first refine your ER diagram if necessary. The actual assessment of this part is in the point below.

2. For all the relations that arise from this ("first-cut") ER diagram, list all those that are already in 3NF. If there are some relations that are not in 3NF yet, then convert them into 3NF with proper procedure and explanations.

3. Draw the global relation diagram for your final, revised, and normalised database design, and keep all the relevant details there. It should be in a similar form to Figure of the textbook, but all the attributes should be kept there too. Include in the diagram all the primary keys, foreign keys, and the multiplicity constraints. Identify and discuss the potential data redundancies or anomalies that may still exist in your design, if any.

Posted Date: 3/26/2013 1:44:14 AM | Location : United States







Related Discussions:- Logical database design, Assignment Help, Ask Question on Logical database design, Get Answer, Expert's Help, Logical database design Discussions

Write discussion on Logical database design
Your posts are moderated
Related Questions
There are four data type groups:  Integer kepts whole numbers and signed numbers Floating-point Stores real numbers (fractional values). Perfect for storing bank deposit

Define tractable and intractable problems Problems that can be solved in polynomial time are known as tractable problems, problems that cannot be solved in polynomial time are

#question.explain different types of errors in data transmission.

An unsorted array is searched through linear search that scans the array elements one by one until the wanted element is found. The cause for sorting an array is that we search

include include include /* Definition of structure node */ typedef struct node { int data; struct node *next; } ; /* Definition of push function */

write an algorithm for stack using array performing the operations as insertion ,deletion , display,isempty,isfull.

Problem Your LC code is stored in a memory location as shown and the variable name is LC                  LC Memory address       Content(LC code)

Q. Describe the term array.  How do we represent two-dimensional arrays in memory?  Explain how we calculate the address of an element in a two dimensional array.

Queue is a linear data structure utilized in several applications of computer science. Such as people stand in a queue to get a specific service, several processes will wait in a q

Beauty Salon is a system to be designed to manage the booking and the payment of a single beauty parlour. Beauty Therapists: A beauty parlour has a number of staff members mo