Using MIS (9th Edition)
Using MIS (9th Edition)
9th Edition
ISBN: 9780134106786
Author: David M. Kroenke, Randall J. Boyle
Publisher: PEARSON
Expert Solution & Answer
Book Icon
Chapter 5.8, Problem 6ARQ

Explanation of Solution

Three components of database design:

The three components of the database design are as follows:

  • Tables
    • When data are organized in rows and columns, it is called as table.
  • Relationship
    • The relationship laid between two tables are established using a row.
  • Metadata
    • Metadata gives information about other data or simply, it is a data about the data.

Normalization:

When an unstructured table is converted in a way to form one or more properly structured table is called as normalization.

Importance of the normalization:

The main purpose of normalization is to convert the unstructured table into structured table and the importances to perform normalization are as follows:

  • Eliminate data redundancy.
  • Isolating the data such that any changes made in the table does not affect other contents.
  • Ensures proper data dependencies.
  • Makes data to be consistent through the table.

Data integrity problem:

Data integrity problem arises when the accuracy and consistency of the data stored in the database is not maintained.

  • Consider the information present in a table needs to be updated and that change should be reflected to the entire database contents and if the contents are not properly updated then the data integrity problem arises.

Consequence of data integrity problem:

The main consequence of the data integrity problem is that the data contents present in the table are not properly updated and any action that needs to be processed for that table and those contents can produce inconsistency in the results.

  • The results obtained from that table will be incorrect and inconsistent.

Example table with data integrity problem:

Consider the below table named “Bank” with the necessary contents:

Table name: Bank

Name Date_of_join Branch_id BranchName
James Mar 3,2014 101 S1B
Rita Jan 22,2011 100 MB
Ron Oct 2,2000 108 S8B
joules Aug 21,2002 100 MB
Zita Jan 22,2011 100 MB
Larry Apr 2,2000 108 S8B

In the above the table, the name of the branch “MB” has to be changed to “MSB”:

Table name: Bank

Name Date_of_join Branch_id BranchName
James Mar 3,2014 101 S1B
Rita Jan 22,2011 100 MSB
Ron Oct 2,2000 108 S8B
joules Aug 21,2002 100 MB
Zita Jan 22,2011 100 MSB
Larry Apr 2,2000 108 S8B

In the above table, the highlighted content of the table is found to be improperly updated and will lead to data integrity problem. When the data of the account holders whose branch name of “MSB” needs to be counted but since the data has been improperly updated the count of the result produced will be incorrect and to avoid this kind of problem normalization is the best choice.

Normalization of a table:

The above table “Bank” is being normalized to avoid the data integrity problem and needs to be split into two tables to obtain data consistency in them.

Table name: Bank

Name Date_of_join Branch_id
James Mar 3,2014 101
Rita Jan 22,2011 100
Ron Oct 2,2000 108
joules Aug 21,2002 100
Zita Jan 22,2011 100
Larry Apr 2,2000 108

Table name: NameofBranch

Branch_id BranchName
100 MSB
101 S1B
108 S8B

Therefore, from the above table, the redundancy of the data is being avoided, thus avoiding the inconsistency with the contents of the table...

Blurred answer
Students have asked these similar questions
Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…
how to read log logs
Discrete Mathematics for Computer Engineering
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education