Normalization tech a lot of is utilized especially initiate because perspicuous and is applied.
Normalization basics
• form’s normal (normal form) are a braze from relationship database scheme that is defined for meeting aim of in height integrity and maintainability
• Kreasi of a normal form to be called normalization
Normalization reached by dependency analysing between each individual attribut that diassosiasikan with its relationship
Database design process (review)
1. Gather user needs / business
2. Develop a needs-based ER Model user / business
3. Convert E-R model to the set of relations (tables)
4. Normalization is to remove the anomaly relations
5. Implemented to create a database with a table for each relationship that is ter normalization

Database design process (review)
1. Normalization process is the establishment of the database structure so that most of the ambiguity can be removed.
2. Normalization stage, starting from the most mild (1NF) to most stringent (5NF)
3. Usually only up to the level of 3NF or BCNF because already sufficient to generate the table-a table of good quality.

Normalisasi Basis Data (2)
Why do normalization?
a. Optimizing table structures
b. Increase speed
c. The income data is the same
d. More efficient in the use of storage media
e. Reduce redundancy
f. Avoid anomalies (insertion anomalies, deletion anomalies, update anomalies).
g. Improved data integrity

Normalisasi Basis Data (3)
1. A table saying good (efficient) or if the normal 3 to meet the following criteria:
a. If there is decomposition (decomposition) table, it must be guaranteed safe dekomposisinya (Lossless-Join Decomposition). That is, after the table is described / in the decomposition into a new table-table, the table-table can generate a new table with the same exact.
b. Maintain dependence on the functional changes in data (Dependency preservation).
c. Does not violate Boyce-Code Normal Form (BCNF)
2. If the three criteria (BCNF) can not be met, then at least the table does not violate the Normal Form of the third stage (3rd Normal Form / 3NF).

Functional Dependency (1)
1. Functional Dependency describes a relationship attributes in relation
2. An attribute said functionally dependant on the other, if we use the value attribute to determine the value of the other attributes.
3. Symbol that is -> used to represent the functional dependency.
reads determine the functional

Functional Dependency (2)
1. Notasi: A à B
a. A and b is attribute of one table. Matter functionally A determines b or b cling to, if and only if available 2 data row with appreciative A same, therefore point b also with
2. Notasi: A à B atau A xà B
a. Are opposite of previous notation.

Functional Dependency (fd)
example :

a. Functional Dependency:
NRP à Nama
Mata_Kuliah, NRP à Nilai
b. Non Functional Dependency:
Mata_Kuliah à NRP
NRP à Nilai

Functional Dependency (4)
• Functional Dependency of point table
a. Nrp -> Name
Since for each point same Nrp, therefore Name point also with
b. {Mata_kuliah, NRP} -> Point
Since attribut Assesses to cling to Mata_kuliah and NRP IS ala goes together. In other mean for Mata_kuliah and same NRP, therefore Point also with, since Mata_kuliah and NRP constitutes to go to y. (get unique character).
c. Mata_kuliah -> NRP
d. NRP -> Point

First Normal Form – 1NF)
a. A relationship available in condition First Form’s Normal (1NF) if and only if all domain that implicated just consist atomic value, e.g. no group repeat (domain domain) in a tuple
b. Gain from 1NF appealed by Unnormalized Relation (UNRs) are on representasi’s moderation form and easy in development utilizes a query language
c. Its lack is requirement to data ‘s duplication
d. Largely relation systems (are not all) need a shaped deep relationship 1NF
A table on the form said to be normal if I did not reside in the unnormalized form of a table, where there is a kind of field multiplication and field that allows a null (empty)
Not allowed in there:
1. Many attributes of value (Multivalued attributes).
2. Attributes composite or a combination of both.
So:
1. Price is the domain attribute must be atomic rates

Example
For example College Student Data as follows:

Or

Example (2)
Decomposition becomes:
a. College Student table:

b. Hobby table:

Second Normal Form – 2NF)
1. Normal form 2NF met in a table if it meets the form of 1NF, and all the attributes than the primary key, have a full Functional Dependency on primary key
2. A table does not meet 2NF, if there are attributes that ketergantungannya (Functional Dependency) are only partial (only depending on the part of the primary key)
3. If there are attributes that have no dependence on the primary key, then the attributes must be moved or removed
4. Functional Y is full if it is said to delete an attribute A from X -> dependency X means that Y is no longer dependent functional.
5. Y said if deleting a partial attribute A from X means that Y is functionally dependent.-> Functional dependency X
6. R depend on the full primary key fungsioanl R.Relation scheme R in the form 2NF if every non-primary key attribute A

Example
This following table accomplishes 1NF, but excluding 2NF

Example (2)

1. Does not meet 2NF, because (NIM, KodeMk) is regarded as the primary key:
NamaMhs -> (NIM, KodeMk)
Address -> (NIM, KodeMk)
Matakuliah -> (NIM, KodeMk)
SKS ->(NIM, KodeMk)
NilaiHuruf -> (NIM, KodeMk)
2. Table needs to be some table didekomposisi eligible 2NF

Example (3)
1. Functional dependencynya as follows:
NilaiHuruf (fd1) -> (NIM, KodeMk)
(NamaMhs, Address) (fd2) -> NIM
(Matakuliah, SKS) (fd3) -> KodeMk
2. So that:
Value Table -> fd1 (NIM, KodeMk, NilaiHuruf)
Table Student -> fd2 (NIM, NamaMhs, Address)
Table MataKuliah -> fd3 (KodeMk, Matakuliah, SKS)

(Third Normal Form – 3NF) (1)
1. Normal form 3NF fulfilled if the form meets 2NF, and if there are no non-primary key attribute that has a dependence on non-primary key attributes of the other (transitive dependencies).

Example (1)
1. Table following students eligible 2NF, 3NF, but does not meet

2. Because there are non-primary key attribute (ie, City and Provincial), which has a dependence on non-primary key attributes of the other (ie KodePos):
(City, Province)KodePos

Example (2)
1. So that the table in the decomposition needs to be:
2. Student (NIM, NamaMhs, Road, KodePos)
KodePos (KodePos, Province, City)

Boyce-Codd Normal Form (BNCF)
1. Boyce-Codd Normal Form constraint has a stronger form of the Normal third. To be BNCF, relations must be in the form of Normal Kesatu and forced each of the attributes depends on the function in the super key attributes.
2. In the example below there is a relationship seminar, is the Primary Key NPM + Seminar.
Students may take one or two seminars. Each seminar requires 2 each of the students and led by one of the 2 seminar. Each leader can only take one seminar course. NPM in this example and show a Seminar Counsellor

Boyce-Codd Normal Form (BNCF)

Seminar Relationship form is shaped Normal drd, but don’t BCNF
since seminar Code is still hinge function on Counsellor, if each Counsellor gets to teach just one seminar. Dependent seminar on one attribute is not super goes to y. as one at presupposes by BCNF. Therefore
seminar relationship shall be broken down as two which is:

Normal form of the fourth and fifth
1. Relations in the fourth normal form (NF 4) if the relation in BCNF and dependency tdak contain many values. To remove the dependency of many values from a relation, we divide the relationship into two new relations. Each relation contains two attributes that have a lot of relationship value.
2. Relations in fifth normal form (5NF) deal with the property called the join without any loss of information (lossless join). Fifth normal form (also called the 5 NF PJNF (projection join normal form). The case is very rare and appear difficult to detect in practice.