Is this in BCNF?BCNF Decomposition algorithm not workingWhat are the options for storing hierarchical data in a relational database?Functional Dependencies: Find the key and decomposition into BCNF and 3NFBCNF Decomposition?Normalizing & decomposing to BCNFDatabase normalization to BCNFHow to BCNF decompose when an attribute has no relation with any othersFinding the strongest normal form and if it isn't in BCNF decompose it?BCNF and Functional dependencyBCNF - Is it possible here? Name, Sport Centre, SportDatabase, how to determine functional dependencies and if is in BCNF?

Why aren't rainbows blurred-out into nothing after they are produced?

What would it take to get a message to another star?

Is it possible to know the exact chord from the roman numerals

Link for download latest Edubuntu

Are there examples in Tanach of 3 or more parties having an ongoing conversation?

Are there any cons in using rounded corners for bar graphs?

What should we do with manuals from the 80s?

What is the farthest a camera can see?

What is the prop for Thor's hammer made of?

Help, I cannot decide when to start the story

What should I do if actually I found a serious flaw in someone's PhD thesis and an article derived from that PhD thesis?

Why not demand President's/candidate's financial records instead of tax returns?

Do I have to cite common CS algorithms?

Will using a resistor in series with a LED to control its voltage increase the total energy expenditure?

When was "Fredo" an insult to Italian-Americans?

Is it OK to draw different current from L1 and L2 on NEMA 14-50?

Does fossil fuels use since 1990 account for half of all the fossil fuels used in history?

How do some PhD students get 10+ papers? Is that what I need for landing good faculty position?

Did Pope Urban II issue the papal bull "terra nullius" in 1095?

How can I communicate my issues with a potential date's pushy behavior?

What is a "soap"?

Are there really no countries that protect Freedom of Speech as the United States does?

Global BGP Routing only by only importing supernet prefixes

How to gracefully leave a company you helped start?



Is this in BCNF?


BCNF Decomposition algorithm not workingWhat are the options for storing hierarchical data in a relational database?Functional Dependencies: Find the key and decomposition into BCNF and 3NFBCNF Decomposition?Normalizing & decomposing to BCNFDatabase normalization to BCNFHow to BCNF decompose when an attribute has no relation with any othersFinding the strongest normal form and if it isn't in BCNF decompose it?BCNF and Functional dependencyBCNF - Is it possible here? Name, Sport Centre, SportDatabase, how to determine functional dependencies and if is in BCNF?






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








-1















Assume that the relation is obtained through decomposition from a relation with attributes ABCDEFGHI and that dependencies over ABCDEFGHI are listed below.



R(A,B,F)
B->E
A->F



We need to convert this relation into BCNF



What i have done till now is



R1(AB)
R2(AF)
R3(BE)



Is there anything more I should do? Is this proper BCNF or am I missing something?










share|improve this question


























  • Re "is this right": Show the steps of your work following your reference/textbook, with justification--we want to check your work but not redo it & we need your choices when an algorithm allows them & otherwise we can't tell you where you went wrong (or right). See hits googling 'stackexchange homework.

    – philipxy
    Mar 27 at 20:42

















-1















Assume that the relation is obtained through decomposition from a relation with attributes ABCDEFGHI and that dependencies over ABCDEFGHI are listed below.



R(A,B,F)
B->E
A->F



We need to convert this relation into BCNF



What i have done till now is



R1(AB)
R2(AF)
R3(BE)



Is there anything more I should do? Is this proper BCNF or am I missing something?










share|improve this question


























  • Re "is this right": Show the steps of your work following your reference/textbook, with justification--we want to check your work but not redo it & we need your choices when an algorithm allows them & otherwise we can't tell you where you went wrong (or right). See hits googling 'stackexchange homework.

    – philipxy
    Mar 27 at 20:42













-1












-1








-1








Assume that the relation is obtained through decomposition from a relation with attributes ABCDEFGHI and that dependencies over ABCDEFGHI are listed below.



R(A,B,F)
B->E
A->F



We need to convert this relation into BCNF



What i have done till now is



R1(AB)
R2(AF)
R3(BE)



Is there anything more I should do? Is this proper BCNF or am I missing something?










share|improve this question
















Assume that the relation is obtained through decomposition from a relation with attributes ABCDEFGHI and that dependencies over ABCDEFGHI are listed below.



R(A,B,F)
B->E
A->F



We need to convert this relation into BCNF



What i have done till now is



R1(AB)
R2(AF)
R3(BE)



Is there anything more I should do? Is this proper BCNF or am I missing something?







database database-normalization functional-dependencies bcnf






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Apr 1 at 11:09









Mike Sherrill 'Cat Recall'

72k13 gold badges91 silver badges146 bronze badges




72k13 gold badges91 silver badges146 bronze badges










asked Mar 27 at 10:57









sania00sania00

11 bronze badge




11 bronze badge















  • Re "is this right": Show the steps of your work following your reference/textbook, with justification--we want to check your work but not redo it & we need your choices when an algorithm allows them & otherwise we can't tell you where you went wrong (or right). See hits googling 'stackexchange homework.

    – philipxy
    Mar 27 at 20:42

















  • Re "is this right": Show the steps of your work following your reference/textbook, with justification--we want to check your work but not redo it & we need your choices when an algorithm allows them & otherwise we can't tell you where you went wrong (or right). See hits googling 'stackexchange homework.

    – philipxy
    Mar 27 at 20:42
















Re "is this right": Show the steps of your work following your reference/textbook, with justification--we want to check your work but not redo it & we need your choices when an algorithm allows them & otherwise we can't tell you where you went wrong (or right). See hits googling 'stackexchange homework.

– philipxy
Mar 27 at 20:42





Re "is this right": Show the steps of your work following your reference/textbook, with justification--we want to check your work but not redo it & we need your choices when an algorithm allows them & otherwise we can't tell you where you went wrong (or right). See hits googling 'stackexchange homework.

– philipxy
Mar 27 at 20:42












1 Answer
1






active

oldest

votes


















0














This answer follows from the edited question, under the following hypotheses:



  1. the original relation is R(ABCDEFGHI)

  2. a cover of the functional dependencies holding on it is B->E, A->F

Of course if my hypotheses are wrong the answer is wrong!



In this case:



  1. the only candidate key of the original relation is ABCDGHI;

  2. in the decomposed relation R1(ABF) the only non-trivial dependency that holds is A -> F, so the relation has the only candidate key AB;

  3. the relation is not in BCNF, and a decomposition in BCNF is R2(AF), R3(AB)

Note that you cannot decompose a relation adding an extraneous attribute, like E in your decomposition.






share|improve this answer



























  • Thank you for your input sir.But i'm a bit confused about it not being BCNF. Is there an algorithm I could follow to convert it to bcnf?

    – sania00
    Mar 27 at 11:59






  • 1





    There are algorithm described more or less formally in books on databases. A sketch of an algorithm is shown here.

    – Renzo
    Mar 27 at 14:34










Your Answer






StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55375541%2fis-this-in-bcnf%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0














This answer follows from the edited question, under the following hypotheses:



  1. the original relation is R(ABCDEFGHI)

  2. a cover of the functional dependencies holding on it is B->E, A->F

Of course if my hypotheses are wrong the answer is wrong!



In this case:



  1. the only candidate key of the original relation is ABCDGHI;

  2. in the decomposed relation R1(ABF) the only non-trivial dependency that holds is A -> F, so the relation has the only candidate key AB;

  3. the relation is not in BCNF, and a decomposition in BCNF is R2(AF), R3(AB)

Note that you cannot decompose a relation adding an extraneous attribute, like E in your decomposition.






share|improve this answer



























  • Thank you for your input sir.But i'm a bit confused about it not being BCNF. Is there an algorithm I could follow to convert it to bcnf?

    – sania00
    Mar 27 at 11:59






  • 1





    There are algorithm described more or less formally in books on databases. A sketch of an algorithm is shown here.

    – Renzo
    Mar 27 at 14:34















0














This answer follows from the edited question, under the following hypotheses:



  1. the original relation is R(ABCDEFGHI)

  2. a cover of the functional dependencies holding on it is B->E, A->F

Of course if my hypotheses are wrong the answer is wrong!



In this case:



  1. the only candidate key of the original relation is ABCDGHI;

  2. in the decomposed relation R1(ABF) the only non-trivial dependency that holds is A -> F, so the relation has the only candidate key AB;

  3. the relation is not in BCNF, and a decomposition in BCNF is R2(AF), R3(AB)

Note that you cannot decompose a relation adding an extraneous attribute, like E in your decomposition.






share|improve this answer



























  • Thank you for your input sir.But i'm a bit confused about it not being BCNF. Is there an algorithm I could follow to convert it to bcnf?

    – sania00
    Mar 27 at 11:59






  • 1





    There are algorithm described more or less formally in books on databases. A sketch of an algorithm is shown here.

    – Renzo
    Mar 27 at 14:34













0












0








0







This answer follows from the edited question, under the following hypotheses:



  1. the original relation is R(ABCDEFGHI)

  2. a cover of the functional dependencies holding on it is B->E, A->F

Of course if my hypotheses are wrong the answer is wrong!



In this case:



  1. the only candidate key of the original relation is ABCDGHI;

  2. in the decomposed relation R1(ABF) the only non-trivial dependency that holds is A -> F, so the relation has the only candidate key AB;

  3. the relation is not in BCNF, and a decomposition in BCNF is R2(AF), R3(AB)

Note that you cannot decompose a relation adding an extraneous attribute, like E in your decomposition.






share|improve this answer















This answer follows from the edited question, under the following hypotheses:



  1. the original relation is R(ABCDEFGHI)

  2. a cover of the functional dependencies holding on it is B->E, A->F

Of course if my hypotheses are wrong the answer is wrong!



In this case:



  1. the only candidate key of the original relation is ABCDGHI;

  2. in the decomposed relation R1(ABF) the only non-trivial dependency that holds is A -> F, so the relation has the only candidate key AB;

  3. the relation is not in BCNF, and a decomposition in BCNF is R2(AF), R3(AB)

Note that you cannot decompose a relation adding an extraneous attribute, like E in your decomposition.







share|improve this answer














share|improve this answer



share|improve this answer








edited Mar 28 at 10:44

























answered Mar 27 at 11:34









RenzoRenzo

19.1k4 gold badges35 silver badges48 bronze badges




19.1k4 gold badges35 silver badges48 bronze badges















  • Thank you for your input sir.But i'm a bit confused about it not being BCNF. Is there an algorithm I could follow to convert it to bcnf?

    – sania00
    Mar 27 at 11:59






  • 1





    There are algorithm described more or less formally in books on databases. A sketch of an algorithm is shown here.

    – Renzo
    Mar 27 at 14:34

















  • Thank you for your input sir.But i'm a bit confused about it not being BCNF. Is there an algorithm I could follow to convert it to bcnf?

    – sania00
    Mar 27 at 11:59






  • 1





    There are algorithm described more or less formally in books on databases. A sketch of an algorithm is shown here.

    – Renzo
    Mar 27 at 14:34
















Thank you for your input sir.But i'm a bit confused about it not being BCNF. Is there an algorithm I could follow to convert it to bcnf?

– sania00
Mar 27 at 11:59





Thank you for your input sir.But i'm a bit confused about it not being BCNF. Is there an algorithm I could follow to convert it to bcnf?

– sania00
Mar 27 at 11:59




1




1





There are algorithm described more or less formally in books on databases. A sketch of an algorithm is shown here.

– Renzo
Mar 27 at 14:34





There are algorithm described more or less formally in books on databases. A sketch of an algorithm is shown here.

– Renzo
Mar 27 at 14:34








Got a question that you can’t ask on public Stack Overflow? Learn more about sharing private information with Stack Overflow for Teams.







Got a question that you can’t ask on public Stack Overflow? Learn more about sharing private information with Stack Overflow for Teams.



















draft saved

draft discarded
















































Thanks for contributing an answer to Stack Overflow!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55375541%2fis-this-in-bcnf%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Kamusi Yaliyomo Aina za kamusi | Muundo wa kamusi | Faida za kamusi | Dhima ya picha katika kamusi | Marejeo | Tazama pia | Viungo vya nje | UrambazajiKuhusu kamusiGo-SwahiliWiki-KamusiKamusi ya Kiswahili na Kiingerezakuihariri na kuongeza habari

SQL error code 1064 with creating Laravel foreign keysForeign key constraints: When to use ON UPDATE and ON DELETEDropping column with foreign key Laravel error: General error: 1025 Error on renameLaravel SQL Can't create tableLaravel Migration foreign key errorLaravel php artisan migrate:refresh giving a syntax errorSQLSTATE[42S01]: Base table or view already exists or Base table or view already exists: 1050 Tableerror in migrating laravel file to xampp serverSyntax error or access violation: 1064:syntax to use near 'unsigned not null, modelName varchar(191) not null, title varchar(191) not nLaravel cannot create new table field in mysqlLaravel 5.7:Last migration creates table but is not registered in the migration table

은진 송씨 목차 역사 본관 분파 인물 조선 왕실과의 인척 관계 집성촌 항렬자 인구 같이 보기 각주 둘러보기 메뉴은진 송씨세종실록 149권, 지리지 충청도 공주목 은진현