DocumentCode
2936183
Title
Determining All Candidate Keys Based on Karnaugh Map
Author
Zhang Yi-Shun
Author_Institution
Comput. & Inf. Eng. Coll., ZheJiang Gongshang Univ., Hangzhou, China
Volume
4
fYear
2009
fDate
26-27 Dec. 2009
Firstpage
226
Lastpage
229
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.
Keywords
formal logic; relational databases; Karnaugh map; Q-M method; candidate keys; logic algebra; relational database; Algebra; Data engineering; Design engineering; Educational institutions; Industrial engineering; Information management; Innovation management; Logic functions; Process design; Relational databases; Karnaugh map; candidate key; prime implicate; relational database;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Management, Innovation Management and Industrial Engineering, 2009 International Conference on
Conference_Location
Xi´an
Print_ISBN
978-0-7695-3876-1
Type
conf
DOI
10.1109/ICIII.2009.515
Filename
5370522
Link To Document