Determining All Candidate Keys Based on Karnaugh Map

Authors:
Yi-Shun Zhang
Affiliations:
-
Venue:
ICIII '09 Proceedings of the 2009 International Conference on Information Management, Innovation Management and Industrial Engineering - Volume 04
Year:
2009

Citing 0
Cited 1

Automated reasoning to infer all minimal keys

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.