男孩编码和发现候选键 [英] boyce codd and finding candidate keys

问题描述

需要绝望的帮助理解boyce codd和找到候选键。
i在此找到一个链接 http://djitz.com/

needing desperate help with understanding boyce codd and finding the candidate keys. i found a link here http://djitz.com/neu-mscs/how-to-find-candidate-keys/ which i have understood for most part but i get stuck

例如

（ABCDEF）

AB→CDE

BCD→A

BCE→AD

BD→E

就我的理解从链接我知道你发现左侧的共同集只有B，右侧的共同集是无

right as far as i understand from the link i know you find the common sets from the left which is only B, and common sets from the right which are none

现在在哪里我从这里去吗？我知道所有的候选人集合将有B在他们，但我需要指导寻找候选人集后。有人用简单的语言解释

now where do i go from here? i know all candidate sets will have B in them but i need guidance on finding candidate sets after that. someone explain in simple language

推荐答案

http://www.sroede.nl/projects/fdhelper.aspx

这将有助于提高关系和FD的
点击底部的

this would help'just put in ur relation and FD's click generate at the bottom

这篇关于男孩编码和发现候选键的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！