Determining All Candidate Keys Based on Karnaugh Map

Determining all candidate keys is important step in designing relational database. Familiar algorithms are generally time-consuming and are not easy to get complete result. In this paper we transform the problem into counterpart one in logic algebra and solve it effectively and fully by using Karnaugh map. Q-M method can replace Karnaugh map effectively in the case of greater number of attributes.