third normal form in hindi (3nf) ppt hindi language

shivam65660 29 views 10 slides Aug 11, 2024
Slide 1
Slide 1 of 10
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10

About This Presentation

third normal form in hindi


Slide Content

Database Management System TOPIC– Third Normal Form  (3NF)  Presented To---- Dr. Girish Chandra Pandey Presented By---- SHIVAM PATEL BCA III rd Sem

WHAT IS Normalization  IN DBMS डीबीएमएस ( DBMS) में नॉर्मलाइज़ेशन ( Normalization) डेटाबेस में डेटा को व्यवस्थित करने की एक तकनीक है. इसका मकसद डेटा को हमेशा सही तरीके से इस्तेमाल करना है.   नॉर्मलाइज़ेशन, डेटा में होने वाली इन समस्याओं को दूर करने में मदद करता है :   D ata Redundancy ( डेटा रिडंडेंसी ) I nsertion anomaly ( इंसर्शन विसंगति ) U pdate Discrepancy ( अपडेट विसंगति ) D eletion A nomaly ( डिलीशन विसंगति )  

TYPES OF Normalization   IN DBMS First Normal Form (1NF) SECOND NORMAL FORM (2NF) THIRD NORMAL FORM (3NF) BCNF ( Boyce Codd's normal form ) FOURTH NORMAL FORM (4NF) FIFTH NORMAL FORM (5NF)

3 RD Normalization It's in second normal form (2NF) It has no transitive dependencies NON PRIME --> NON PRIME DEPENDENCY नहीं होगी PRIME ATRIBUTE -> जो KEY बनाने में मेरी मदद करता है NON PRIME ATRIBUTE -> जो KEY बनाने में मेरी मदद नही करता है Third Normal Form (3NF) is a database schema design approach for relational databases. It's used to reduce data duplication and enhance data integrity .

2 RD Normalization TABLE MUST BE IN 1NF NO PARTIAL DEPENDENCY किसी PRIME ATRIBUTE से किसी NON PRIME ATRIBUTE की DEPENDENCY नहीं होनी चाहिए EX— R { A,B,C,D,E} FD- ( AB->C , C->D , D->E , A->B) CANDIDATE KEY– AB PRIME ATRIBUTE --(A),(B) NON PRIME ATRIBUTE – (C),(D),(E) NO PARTIAL DEPENDENCY तो ये 2NF मैं है EX--- R{A,B,C,D,E} FD– (A->B , B->C , C -> D , AD->E ) CANDIDATE KEY – AD PRIME ATRIBUTE – A,D NON PRIME ATRIBUTE --- B,C,E PARTIAL DEPENDENCY PRESENT तो ये 2NF मैं नही है (A->B) P TO P

1 RD Normalization example DATA MUST BE IN TABLER FORM NO DATA PRESENT IN MULTIVALUED

3 RD Normalization Transitive dependencies EXAMPLE--- R (EMP NO.  DEPARTMENT NAME , DEPARTMENT NAME  DEPARTMENT LOCATION) T ransitive Dependencies  [EMP NO.  DEPARTMENT LOCATION REMOVE TRANSITIVE DEPENDENIES

3 RD Normalization NON PRIME ATRIBUTE  PRIME ATRIBUTE EXPL…. FUNCTIONAL DEPENDENCY { I’D  NAME , I’D SUBJECT , SUBJECT STATE , STATE  COUNTRY} RELATION ( I,D , NAME, SUBJECT, STATE, COUNTRY ) CANDIDATE KEY  I,D PRIME ATRIBUTE -> I,D NON PRIME ATRIBUTE -> NAME ,SUBJECT, STATE, COUNTRY NON PRIME ATRIBUTE -> NON PRIME ATRIBUTE FUNCTIONAL DEPENDENCY ARE PRESENT SUBJECT  STATE, STATE COUNTRY , THIS IS NOT 3 RD NORMAL FORM

3 RD Normalization RELATION ( A,B ,C,D) FUNCTIONAL DEPENDENCY { AB CD , D A } CANDIDATE KEY (AB) ,( BD) PRIME ATRIBUTE  ABD NON PRIME ATRIBUTE  C THIS IS 2NF AND NO T ransitive Dependencies THEN THIS IS 3NF……
Tags