Database Systems: Design, Implementation, & Management
Database Systems: Design, Implementation, & Management
11th Edition
ISBN: 9781285196145
Author: Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher: Cengage Learning
bartleby

Concept explainers

Question
Book Icon
Chapter 6, Problem 7RQ

a.

Program Plan Intro

Normalization:

The process used to minimize data redundancy and dependency in a relational database is known as normalization. The database table is divided into two or more tables and defines the relationship between those tables.

First normal form (1NF):

  • If a table does not contain any replicate fields or groups of fields then that model is called as first normal form.
  • In this form, entities do not contain any single instance of the repeating variable.
    • It means that the entities contain only one instance of the attributes, multi-valued attributes are neglected.

Second normal form (2NF):

  • The value of all non-primary key attributes should be dependent on the primary key attribute.
    • If any attribute is depending on the partial primary key then it should determine the other attributes for an instance of the entity.
  • The partial dependencies should be removed from the data model.

Third normal form (3NF):

  • The value of any non-primary key attributes will not depend on any other non-primary key attributes.
    • If any non-primary key attributes depend on any other non-primary key attribute then it should be moved or deleted.
    • It is termed as transitive dependency.

Partial dependency:

A partial dependency exists at that time of an attributes depends only a part of primary key. This dependency is related with 1st normal form.

Transitive dependency:

A transitive dependency exists at that time of an attributes depends on another attribute which is not part of primary key.

Functional dependency:

An association between two attributes or two set of attributes in a same relational database table, which is having some constraints is known as functional dependency.

  • In a table one attribute is functionally dependent on another attribute to take one value.

b.

Explanation of Solution

Dependencies diagrams for each database table:

Table1:

Create the database table with name of Table1 is given below:

Table1 (ISBN, BookTitle, Edition)

  • Here, “ISBN” indicates the primary key.
  • “BookTitle” and “Edition” are partial dependent on ISBN.

Normal form:

  • The relation is in third normal form (3NF), since there is no transitive dependency and no repeated attributes.

The representation of dependency diagram for table1 is shown below:

Table2:

Create the database table with name of Table2 is given below:

Table2 (BookTitle, Publisher)

  •  “BookTitle” are transitive dependent on “Publisher”.

Normal form:

  • The relation is in second normal form (2NF), because there is transitive dependency in this database table.

The representation of dependency diagram for table2 is shown below:

Table3:

Create the database table with name of Table3 is given below:

Table3 (Author_Num, LastName)

  • Here, “Author_Num” indicate the primary key...

Blurred answer
Students have asked these similar questions
solve this questions for me .
a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?
Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781285196145
Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:Cengage Learning
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781305627482
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
A Guide to SQL
Computer Science
ISBN:9781111527273
Author:Philip J. Pratt
Publisher:Course Technology Ptr
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781305971776
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
Fundamentals of Information Systems
Computer Science
ISBN:9781337097536
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning