Introduction to Database Management SystemConsider the following .pdf
0 likes5 views
The document discusses the normalization process of a database relation involving students, detailing various functional dependencies and identifying 'd' as a candidate key. It emphasizes that the functional dependency 'a-> b, c, d, e, f, g' is sufficient to uniquely identify table rows, leading to the conclusion of ignoring other dependencies. Ultimately, the document determines that no further decomposition is necessary as the initial functional dependency satisfies the requirements.
1 of 1
Download to read offline
More Related Content
More from fathimalinks (20)
Recently uploaded (20)
PDF
BÀI TẬP BỔ TRỢ THEO LESSON TIẾNG ANH - I-LEARN SMART WORLD 7 - CẢ NĂM - CÓ ĐÁ...Nguyen Thanh Tu CollectionBÀI TẬP BỔ TRỢ THEO LESSON TIẾNG ANH - I-LEARN SMART WORLD 7 - CẢ NĂM - CÓ ĐÁ...Nguyen Thanh Tu Collection
Introduction to Database Management SystemConsider the following .pdf
- 1. Introduction to Database Management System: Consider the following relation of students: R(A, B, C, D, E, F, G) (A is underlined) D is a candidate key. Suppose the following dependencies exist: FD1: A-> B, C, D, E, F, G FD2: C, D -> A, B, E, F, G FD3: D-> G FD4: F -> C Apply normalization until you cannot decompose the relations further. State the reasons behind each decomposition. Solution FD1: A-> B, C, D, E, F, G: This Functional dependency uniquely idendifies the table row so, all other functional dependecies are not need. we simply ignore all other. >>> for example it any of the FD voilates any of the NF then we will decompose it and create a new table for that FD. Here FD2 voilates 3NF but if we want to decompose it what could be the foreign key in R2 since all other attributes are present in relation R1:(A, B, C, D, E, F, G) . >>>Therefore FD1 is the final one for the Relation.