ZuoTi.Pro
Question

Which of the following statements is CORRECT? (1 Point) Select one: O Every relation that is in 3NF have no redundancy. O A r
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Answer()   None of the above.

Option(1)

  • Every relation that is in 3NF have no redundancy. FALSE

Redundancy may possible in 3NF Relation. There is a chance that relation is in 3 NF and there exist some redundancy, that is a reason we next study BCNF after 3 NF

Option(2)

  • A relation that is in BCNF could have some redundancy.FALSE

No, BCNF is alway free from redundancy that occure from functional dependency

Option(3)

  • Every relation that is in 3NF is also in BCNF FALSE

No if a relation is in 3 NF then it may and may not be in BCNF.

but in reverse if Relation is in BCNF then it must be in 3 NF

Option(4)

  • For Every relation that is not in BCNF we can alway find a lossless join
  • decomposition and dependency preserving relation into BCNF relation. FALSE

Decomposition into BCNF is always lossless decomposition but some time it NOT preserve Dependency

Note:   BCNF is alway free from redundancy that occure from functional dependency.(A - > B)     that we normally study.

but

There is a chance of redundancy that may occure from multi value dependency. (A - - > B)

0 0
Add a comment
Know the answer?
Add Answer to:
Which of the following statements is CORRECT? (1 Point) Select one: O Every relation that is...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Which of the following statements is CORRECT? (1 Point) Select one: O Every relation that is...

    Which of the following statements is CORRECT? (1 Point) Select one: O Every relation that is in 3NF have no redundancy. A relation that is in BCNF could have some redundancy. Every relation that is in 3NF is also in BCNF. For Every relation that is not in BCNF, we can always find a lossless-join and dependency-preserving decomposition of the relation into BCNF relations. All of the above. O None of the above

  • Which of the following statements is CORRECT? (1 Point) Select one: Every relation that is in...

    Which of the following statements is CORRECT? (1 Point) Select one: Every relation that is in 3NF have no redundancy. O A relation that is in BCNF could have some redundancy. Every relation that is in 3NF is also in BCNF. For Every relation that is not in BCNF, we can always find a lossless-join and dependency-preserving decomposition of the relation into BCNE relations All of the above. None of the above.

  • First, come up with a relation with some functional dependencies. At least one of the functional...

    First, come up with a relation with some functional dependencies. At least one of the functional dependencies violates BCNF and at least one other of the functional dependencies makes it not dependency-preserving. Now, do lossless-join decomposition into BCNF although it may not be dependency-preserving. Second, come up with a relation with some functional dependencies that make it dependency-preserving but not lossless-join. Explain every step.

  • my choices for these are wrong. 10 points QUESTION 3 Given R=(A, B, C) is a...

    my choices for these are wrong. 10 points QUESTION 3 Given R=(A, B, C) is a schema and F = {2C-A AB) is a set of FDs that hold on R. Which of the following statements is not true? d=(AB. AC) is a decomposition of that is in BCNF. O Ris in 3NF O BC is a candidate key for R Ris in BCN 10 points QUESTION 4 Given R= (A. 3. CD. E) is a schema and F= (A...

  • For the relation R(O,P,X,Y,E, S) FDs={ O->P, XY->O, OE->S, EY->X, PY->X}. 1.Classi...

    for the relation R(O,P,X,Y,E, S) FDs={ O->P, XY->O, OE->S, EY->X, PY->X}. 1.Classify each functional dependency 2. Decompose the relation into BCNF relation. 3. Determine whether each of the decompositions has the lossless join property with respect to F and conclude for the whole decomposition. 4. Determine whether each of the decompositions has the dependency preserving property with respect to FD and conclude for the whole decomposition

  • Databases question Consider the following relation that stores information about students living in dormitories at a...

    Databases question Consider the following relation that stores information about students living in dormitories at a college: a. Using these assumptions and stating any others you need to make, list all the non-trivial functional dependencies for this relation b. What are the candidate keys for this relation? Identify the primary keys c. Is this relation in third normal form? if not find a 3NF lossless join decomposition of College that preserves dependencies. d.Is the relation or the resulting set of...

  • Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold o...

    Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold over this relation. F=D → C, A B,A-C Question 4.1 (3 Points) Determine all candidate keys of R Question 4.2 (4 Points) Compute the attribute cover of X-(C, B) according to F Question 43 (5 Points) Compute the canonical cover of F.Show each step of the generation according to the algorithm shown in class....

  • Answer the following questions: Consider the relation schema R = (N. Y, P. M. and assume...

    Answer the following questions: Consider the relation schema R = (N. Y, P. M. and assume that the following set of functional dependencies holds on R: The letters can be interpreted as follows: R=(Model_Number. Year, Price, Manufacturing Plant Color). 1. [25 points] Give a lossless.join decomposition of Rinto Boyce-Codd normal form. Make sure to use the algorithm studied in class (Figure 7.11, page 331 of the book) and to show all details. 2. [25 points] Does your decomposition preserve functional dependencies? Justify your...

  • Normalisation Consider the following relation schema about project meetings: PMG(projID, title, type, manager, jobID, start-date, end-date,...

    Normalisation Consider the following relation schema about project meetings: PMG(projID, title, type, manager, jobID, start-date, end-date, contractor, contractNo) Some notes on the semantics of attributes are as follows: • Each project has a unique project ID (projID) and also has a title, type and manager. Each manager has a specialty project type. • A project often contracts jobs to contractors with start-date and end-date. Contracts are identified by contract numbers (contractNo), but contract details are out of the scope of...

  • Is this the correct answer? Thanks Which of the following statements is CORRECT? Select one: O...

    Is this the correct answer? Thanks Which of the following statements is CORRECT? Select one: O a. Because companies are required to follow GAAP, two firms in exactly the same operating situation will have exactly the same financial statement b. The emphasis in finance is on the determination of accounting income since the value of a firm is determined by the net income generated. O c. Even if a firm follows generally accepted accounting principles (GAAP), its reported net income...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT