One small step for a man
One Giant leap for the mankind

There is no wealth like Knowledge
                            No Poverty like Ignorance
Journal of Emerging Trends in Computing and Information Sciences Logo

Journal of Emerging Trends in Computing and Information Sciences >> Call for Papers Vol. 8 No. 3, March 2017

Journal of Emerging Trends in Computing and Information Sciences

An Enhanced Method for Generating Composite Candidate Keys Based on N×M Boolean Matrix

Full Text Pdf Pdf
Author Khaled Saleh Maabreh
ISSN 2079-8407
On Pages 254-258
Volume No. 5
Issue No. 3
Issue Date April 1, 2014
Publishing Date April 1, 2014
Keywords Relational Database, Candidate Key, Functional Dependency, Attribute Closure, Boolean Matrix


Abstract

In a relational database, a candidate key is defined as a set of attributes that is distinct the database rows. The determining process of a candidate key could affect the database performance and optimization. In this paper, an algorithm based on N×M Boolean matrix is proposed to automate the process of candidate key generation for both single and composite attributes based on a functional dependency set, as well as it has the ability to add a new functional dependency attributes as required based on a proved theorem. Results showed that the proposed algorithm can be easily implemented and used in practice. It can be easily expanded to solve N-Level composite attributes set.
Back

Seperator
    Journal of Computing | Call for Papers (CFP) | Journal Blog | Journal of Systems and Software | ARPN Journal of Science and Technology | International Journal of Health and Medical Sciences | International Journal of Economics, Finance and Management     
Copyrights
© 2015 Journal of Computing