Abstract
A logic algebra method is explored for solving key problems of sets of functional dependencies in the theory of relational database. For a given set of functional dependencies, we first get its corresponding logical function and then determine all prime implicates of the logical function in logic algebra. Each prime implicate represents a nontrivial and simplest functional dependency implied by original set of functional dependencies, and vice versa. By using these prime implicates all equivalent minimal covers, all candidate keys and closure of arbitrary sets of attributes for the given set of functional dependencies are computed unitedly and directly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
