100 likes | 154 Views
P01. Teaching Aid for Bernstein’s Algorithm. with Step-by-step Explanation. Wong Kim Wee Alvin U099023H Chua Jie Sheng A0073894N Steve Ng A0074059B Chin Gui Pei A0073834B. Overview. Problem. Proposed Solution. Architecture. Demo. Problem. Reconstructibility.
E N D
P01 Teaching Aid for Bernstein’s Algorithm with Step-by-step Explanation Wong Kim Wee Alvin U099023H Chua Jie Sheng A0073894N Steve Ng A0074059B Chin Gui Pei A0073834B
Overview Problem Proposed Solution Architecture Demo
Problem Reconstructibility Finding all possible keys Removing superfluous attributes BCNF may contain superfluous attribute Depends on non-redundant covering
Proposed Solution 1. Eliminate extraneous attributes 2. Find covering 3. Partition 5. Eliminate transitive dependencies 4. Merge equivalent keys 6. Construct relations 7. Ensure reconstructibility 8. Find all keys
Ensuring Reconstructibility 3. Search for attributes in FDs 1. Join all relations 2. Find missing attributes 4. Search for attributes in MVDs 5. Display missing attributes without FD or MVD
Finding All Keys 1. Retrieve all keys 2. Find intersection 3. Determine missing keys 4. Determine possible keys
Architecture Step 1 Step 2 Step 3 Step 4 Step 5 Step 6 Reconstruct Find all keys