Changes between Version 4 and Version 5 of P5

Timestamp:

01/27/26 23:22:15 (13 days ago)

Author:

213087

Comment:

--

P5

@@ -58 +58 @@
 
 
-Please review the proof here [[Proof of Candidate Key]]
+Please review the proof explained in more details here -> [[Proof of Candidate Key]]
 
 || Candidate Key ||
@@ -70 +70 @@
 A relation is in 1NF if:
 
-All attributes contain atomic values
-
-No repeating groups exist
-
-The UNF relation contains repeating venue and booking attributes.
+*All attributes contain atomic values
+
+*No repeating groups exist
+
+*The UNF relation contains repeating venue and booking attributes.
 
 === Transformation to 1NF ===
@@ -88 +88 @@
 All attributes are now atomic.
 
+Please review the proof explained in more details here -> [[Proof of 1N form]]
+
 == Second Normal Form (2NF) ==
 
@@ -93 +95 @@
 A relation is in 2NF if:
 
-It is in 1NF
-
-No non-key attribute is partially dependent on a composite key
+*It is in 1NF
+
+*No non-key attribute is partially dependent on a composite key
 
 === Partial Dependency Proof ===
@@ -128 +130 @@
 This decomposition is mandatory for correctness.
 
+Please review the proof explained in more details here -> [[Proof of 2N]]
+
 == Third Normal Form (3NF) ==
 
@@ -159 +163 @@
 This ensures entity integrity.
 
+Please review the proof explained in more details here -> [[Proof of 3N]]
+
 == Lossless Join Decomposition Proof ==