ADVANCE DATABASE NORMALIZATION Flashcards

1
Q

is a database design technique that organizes tables in a manner that reduces redundancy and dependency of
data.

A

NORMALIZATION

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
  • The purpose of Normalization is to eliminate ____
    ___ and ensure data is stored logically.
A

redundant (useless) data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

The inventor of the relational model ____ proposed the
theory of normalization

A

Edgar Frank Codd

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

is the process of organizing data to
minimize redundancy in the design
of a relational database
management system (RDBMS)

A

Database
Normalization or Normalization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

This rule is all about disallowing multivalued attributes

A

Eliminate repeating
data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Goals of Normalization

A
  • ELIMINATE REDUNDANT
    DATA
  • ELIMINATE INSERT, DELETE,
    AND UPDATE ANOMALIES
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Three main rules for normalizing data

A

Eliminate repeating
data
Eliminate partial
dependencies
Eliminate transitive
dependencies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

This refers to situations where the primary key for a table is a composite
primary key, which means ‘a key composed of multiple columns’.

A

Eliminate partial
dependencies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

This refers to situations where in a column in the table refers to a non-key
column instead of referring to the primary key of a table.

A

Eliminate transitive
dependencies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Problems that can occur in poorly
planned, unnormalized databases
where all the data is stored in one
table (a flat- file database).

A

Anomaly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Types of Anomalies:

A

Insert Delete Update

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Suppose a new faculty joins the University, and the Database Administrator inserts the faculty data into the above table. But he is not able to insert because Sid is a primary key, and can’t be NULL. So this type
of anomaly is known as an

A

insertion anomaly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

When the Database Administrator wants to delete the
student details of Sid=2 from the above table, then it will
delete the faculty and course information too which
cannot be recovered further.

A

Delete Anomaly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

DETELE ANOMALY in SQL:

A

DELETE FROM ___ WHERE __:

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

When the Database Administrator wants to change
the salary of faculty F1 from 30000 to 40000 in above
table University, then the database will update salary
in more than one row due to data redundancy

A

Update Anomaly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Update Anomaly in SQL

A

UPDATE __WHERE ____;

12
Q

evolution of
Normalization
theories

A

1st Normal Form
2nd Normal Form
3rd Normal Form
Boyce Codd NF
4th Normal Form
5th Normal Form
6th Normal Form

13
Q

states that the domain of an attribute must include only atomic
values and that the value of any attribute in a row must be a single
value from the domain of that attribute

A

First Normal Forms

14
Q

pertains to the built-in atomic data types

A

Atomic Values

15
Q

ACID stands for

A

(atomicity, consistency, isolation, and durability)

16
Q

Rules of 1NF

A

Each attribute name must be unique
Each attribute value must be single
Each row must be unique

17
Q

is unique, not null, and unchanged; can be either an attribute or combined attributes

A

primary key

18
Q

The table should be in the First Normal Form.
There should be no Partial Dependency.

A

Second Normal Form (2NF)

19
Q

The attributes
which are used to form a candidate
key are called

A

Prime attributes

20
Q

The attributes
which do not form a candidate key
are called

A

Non-Prime attributes

21
Q

is a
concept that specifies the
relationship between two
sets of attributes where one
attribute determines the
value of another attribute.

A

Functional
Dependency

22
Q

is a specific type of
dependency that happens in tables with
a composite primary key

A

Partial dependency

23
Q

If a non-prime attribute can be
determined by the part of the candidate
key in a relation, it is known as a

A

partial
dependency.

23
Q

a primary key
made up of two or more columns

A

composite primary key

24
Q
  • it should be in the second normal form
  • it should not have transitive dependency
  • all transitive dependencies are removed to place in another table
A

Third Normal Form (3NF)

25
Q

a functional dependency is said to be transitive if it is directly formed by two functional dependencies (True or False)

A

FALSE - INDIRECTLY

26
Q

is said to be
transitive if it is indirectly formed by two
functional dependencies.

A

functional dependency