Given a relation and asked to enumerate all FD's and mark the trivial FD's












0
















Given a relation R(A,B,C) and a FD set (A->B, B->C), find the FD Closure. Enumerate all the FD's and organize them accordingly to the LHS of the FD's. Mark all the trivial FD's.


I am a little confused with the second part of the question and don't understand what exactly they mean by "organize them accordingly to the LHS of the FD's"
My understanding is, Apart from the given FD's, we have A->C(on account of transitivity) and the trivial FD's will be A->A , B->B, C->C, A->AB, A->AC, B->BC. Is this the answer to the given question or am I missing something here?










share|improve this question



























    0
















    Given a relation R(A,B,C) and a FD set (A->B, B->C), find the FD Closure. Enumerate all the FD's and organize them accordingly to the LHS of the FD's. Mark all the trivial FD's.


    I am a little confused with the second part of the question and don't understand what exactly they mean by "organize them accordingly to the LHS of the FD's"
    My understanding is, Apart from the given FD's, we have A->C(on account of transitivity) and the trivial FD's will be A->A , B->B, C->C, A->AB, A->AC, B->BC. Is this the answer to the given question or am I missing something here?










    share|improve this question

























      0












      0








      0









      Given a relation R(A,B,C) and a FD set (A->B, B->C), find the FD Closure. Enumerate all the FD's and organize them accordingly to the LHS of the FD's. Mark all the trivial FD's.


      I am a little confused with the second part of the question and don't understand what exactly they mean by "organize them accordingly to the LHS of the FD's"
      My understanding is, Apart from the given FD's, we have A->C(on account of transitivity) and the trivial FD's will be A->A , B->B, C->C, A->AB, A->AC, B->BC. Is this the answer to the given question or am I missing something here?










      share|improve this question















      Given a relation R(A,B,C) and a FD set (A->B, B->C), find the FD Closure. Enumerate all the FD's and organize them accordingly to the LHS of the FD's. Mark all the trivial FD's.


      I am a little confused with the second part of the question and don't understand what exactly they mean by "organize them accordingly to the LHS of the FD's"
      My understanding is, Apart from the given FD's, we have A->C(on account of transitivity) and the trivial FD's will be A->A , B->B, C->C, A->AB, A->AC, B->BC. Is this the answer to the given question or am I missing something here?







      database functional-dependencies






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked Nov 26 '18 at 14:12









      Jerrico KyleJerrico Kyle

      238




      238
























          0






          active

          oldest

          votes











          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%2f53482963%2fgiven-a-relation-and-asked-to-enumerate-all-fds-and-mark-the-trivial-fds%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f53482963%2fgiven-a-relation-and-asked-to-enumerate-all-fds-and-mark-the-trivial-fds%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

          Lallio

          Unable to find Lightning Node

          Futebolista