Implementation of Bernstein's Algorithm and its Shortcomings
Explore the implementation of Bernstein's algorithm, addressing its shortcomings such as losslessness, key finding, and attribute removal. Solutions and a Q&A session are highlighted in the content.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
An Implementation of Bernstein s Algorithm P02 P02 HAN HAN ZIJIAN ZIJIAN LIU LIU YANAN YANAN XIA XIA LU LU ZHOU ZHOU SHAOWEN SHAOWEN
Overview 1. Implement Bernstein's Algorithms 2. Resolve shortcomings 3. Implement an interactive graphic user interface 4. Find closure of attributes 5. Check normal forms
Algorithm 1.Remove extraneous attributes 2.Find covering 3.Partition 4.Merge groups 5.Remove transitive functional dependencies 6.Construct relations
Shortcomings 1. Does not guarantee losslessness Our solution: Find missing attributes Construct a new relation using one key and all missing attributes
Shortcomings 2. Does not find all the keys Our solution: Find all super keys in each relations Remove the keys which are not candidate keys
Shortcomings 3. Does not remove all superfluous attributes An attribute is superfluous if and only if its removal does not alter covering and reconstructibility Reconstructible Non-essential Our solution: Ling, Tompa and Kameda s method
