You are given the following set F of functional dependencies for a rel

Back to the 2019 paper

Module 2: Relational Query Languages & Design

20199m

You are given the following set F of functional dependencies for a relation:
R(A, B, C, D, E, F): F = {ABC → D, ABD → E, CD → F, CDF → B, BF → D}

(i) Find all keys of R based on these functional dependencies.
(ii) Is this relation in Boyce-Codd normal form? Is it 3NF? Explain your answer.
(iii) Can the set F be simplified (by removing functional dependencies or by removing attributes from the left-hand side of functional dependencies) without changing the closure of F (i.e. F+)?

Search Google Ask AI

Similar questions

Database Management SystemCompute the closure of the following set F of functional dependencies for relation schema: R = (A, B, C, D, E). A → BC, CD → E, B → D, E → A List the candidate keys for R.20195m Database Management SystemCompute the closure (F+) of the following set of functional dependencies for the relational schema (A, B, C, D, E) = R. List the candidate keys for R: A → BC CD → E B → D E → A202014m Database Management SystemFor relation R(A,B,C,D,E) functional dependencies are given as follows: * A \rightarrow BC * CD \rightarrow E * B \rightarrow D Find candidate keys.20254m Database Management SystemRelation R (ABCDEFGH) contains only atomic values for all of its attributes. F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F is exactly the set of FDs that hold for R. (i) Find all the candidate keys the relation R have? (ii) Find the highest normal form with justification in which R exist?20227m

PreviousConsidering the following schema, create the appropriate tables and insert at least 5 records: AUTHOR (author-id, name, city, country) PUBLISHER (publisher-id, name, city, country) CATALOG (book-id, title, author-id, publisher-id, category-id, year, price) CATEGORY (category-id, description) ORDER-DETAILS (order-no, book-id, quantity) Write each of the following queries in SQL and relational algebra: (a) Obtain the names of authors who have 2 or more books in the catalog. (b) Find the author of the book which has maximum sales. (c) Obtain the names of author who have maximum number of publisher. (d) Obtain the name of the city, author, publisher where publisher and author belong to same city. (e) Obtain the title of books which has maximum sales. (f) Obtain the book-id, description for the author who have exactly 3 books in the catalog. (g) Obtain the author and publisher who have published books in more than or equal to 2 categories.NextCompute the closure of the following set F of functional dependencies for relation schema: R = (A, B, C, D, E). A → BC, CD → E, B → D, E → A List the candidate keys for R.