Preview

Normalization Questions

Satisfactory Essays
Open Document
Open Document
418 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Normalization Questions
NORMALIZATION
TUTORIAL (EXTRA)

1. Given the dependency diagram, answer items a-c:

[pic]

a. Identify and discuss each of the indicated dependencies.

C1 ( C2 represents a partial dependency, because C2 depends only on C1, rather than on the entire primary key composed of C1 and C3.

C4 ( C5 represents a transitive dependency, because C5 depends on an attribute (C4) that is not part of a primary key.

C1, C3 ( C2, C4, C5 represents a set of proper functional dependencies, because C2, C4, and C5 depend on the primary key composed of C1 and C3.

b. Create a database whose tables are at least in 2NF, showing the dependency diagrams for each table.

[pic] c. Create a database whose tables are at least in 3NF, showing the dependency diagrams for each table.

[pic]

Transitive dependency is a condition in which an attribute is dependent on another attribute that is not part of the primary key. This kind of dependency usually requires the decomposition of the table containing the transitive dependency.

To remove a transitive dependency, the designer must perform the following actions: • Place the attributes that create the transitive dependency in a separate table. • Make sure that the new table's primary key attribute is the foreign key in the original table.

Figure Q5.9 shows an example of a transitive dependency removal.

Figure Q5.9 Transitive Dependency Removal
[pic]

1. Using the INVOICE table structure shown in Table P5.1, write the relational schema, draw its dependency diagram and identify all dependencies (including all partial and transitive dependencies). You can assume that the table does not contain repeating groups and that any invoice number may reference more than one product. (Hint: This table uses a composite primary key.)

2. Using the initial dependency diagram drawn in Problem 1, remove all partial dependencies, draw the new dependency diagrams,

You May Also Find These Documents Helpful

  • Satisfactory Essays

    PT2520 Unit7Labs Tramil

    • 330 Words
    • 1 Page

    13. What is referential integrity? Exists when every foreign key relates to an existing primary key. There are no orphan records in child tables that have no reference in a parent table.…

    • 330 Words
    • 1 Page
    Satisfactory Essays
  • Satisfactory Essays

    The Kudler Foods need to design an entity relationship diagram to illustrate what needs to be on the table. A few of the tables could be combined to make reading the tables much easier. Kudler foods could combine inventory/order relationship, for example; order/sale relationship table, inventory/sale relationship table, and sale/receive payment relationship table. By combining any one of these tables Kudler Foods could process orders faster, find information faster by having the data in order and labeled and overall making the company’s system more efficient. One table Kudler Foods does not have that the management should consider which would benefit the business is an “employee table”. This way; Kudler could have personal information, sales numbers, last date he/she was reviewed, and just able to keep up…

    • 4521 Words
    • 87 Pages
    Satisfactory Essays
  • Satisfactory Essays

    13 T | A transient dependency is where an attribute depends on another attribute for its meaning and not on the key.…

    • 313 Words
    • 1 Page
    Satisfactory Essays
  • Satisfactory Essays

    Referential Integrity exists when every foreign key relates to an existing primary key. There are no orphan records in child tables that have no reference in a parent table.…

    • 327 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    cis3730_Exam1_Studyguide

    • 512 Words
    • 2 Pages

    Be able to give examples of tables, specify their primary keys, and explain how they are related through foreign keys.…

    • 512 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Pt2520 Final Answers 1/3

    • 329 Words
    • 2 Pages

    when u get a many to many: make a linking table that resolves the many to many into 2 1-1 relationships.…

    • 329 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    | 5. Batches checks 6. Sends checks to cashier 7. Uses payments stub to enter payments into computer…

    • 787 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    IST223 Crib sheet

    • 3425 Words
    • 7 Pages

    rectangles, and relationships are shown by lines between the rectangles. Attributes are generally listed within the rectangle. The many side of many relationships is represented by a crows footentity-relationship (E-R) modelA set of constructs and conventions used to create data models. The things in the users world are represented by entities, and the associations among those things are represented by relationships. The results are usually documented in an entity-relationship (E-R) diagramID-dependent entityan entity whose identifier includes the identifier of another entityidentifierwhich are attributes that name, or identify, entity instancesidentifying relationshipIn such relationships, the parent is always required, but the child (the ID-dependent entity) may or may not be required, depending on application requirements. Identifying relationships are shown with solid lines in E-R diagrams.is-aRelationships among supertype/subtype entitiesmandatoryat least one entity instance must participate in the relationshipmaximum cardinalityThe maximum cardinality is the maximum number of entity instances that can participate in a relationship instance.minimum cardinalityThe minimum cardinality is the minimum number of entity instances that must participate in a relationship instance.nonidentifying relationshiprelationship drawn with a dashed line (refer to Figure 5-7) is used between strong entities and is called a nonidentifying relationship because there are no ID-dependent entities in the relationship.null valueare a problem because they are ambiguous. They can mean that a value is inappropriate, unknown, or known, but not yet been entered into the databaseparentAn entity or row on the one side of a one-to-many relationshiprecursive relationshipoccurs when an entity type has a relationship to itself.relationship classAssociations among entity classesrelationship instanceassociations among entity instances.strong entityan entity that represents something that can exist…

    • 3425 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    Defining a(n) primary key in a second table creates a relationship between that table and the table where the primary key was first defined. _________________________…

    • 585 Words
    • 3 Pages
    Good Essays
  • Good Essays

    07

    • 4772 Words
    • 25 Pages

    5) The SQL keyword CONSTRAINT is used in conjunction with the SQL keywords PRIMARY KEY and FOREIGN KEY.…

    • 4772 Words
    • 25 Pages
    Good Essays
  • Satisfactory Essays

    week 4 Discussion 1

    • 447 Words
    • 2 Pages

    Many legacy systems require normalization. Identify at least two factors that should be considered in order to produce an optimal normalized set of tables when performing normalization. Include in your discussion a detailed example on how each factor would eliminate data redundancy.…

    • 447 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    For our course assignment, we will ignore the multidependencies and focus on bringing the design to 3NF. The design is already in 1NF, but not in 2NF, due to the partial dependency InstructorNum → InstructorName. Split the table into two:…

    • 268 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    04

    • 4586 Words
    • 34 Pages

    A FOREIGN KEY constraint can be added to the column of a table to ensure that the referenced data value actually exists in the other table.…

    • 4586 Words
    • 34 Pages
    Satisfactory Essays
  • Good Essays

    Anime LIst

    • 11441 Words
    • 52 Pages

    Which of the following defines a relationship in which each occurrence of data in one entity…

    • 11441 Words
    • 52 Pages
    Good Essays
  • Satisfactory Essays

    Information Systems

    • 386 Words
    • 2 Pages

    d) Explain how the two tables are related. Which table contains the foreign key? What is the foreign key?…

    • 386 Words
    • 2 Pages
    Satisfactory Essays