Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. R(A,B, C, D, E, H) Functional Dependency: A → B, BC → D,E → C,D → A Find all the minimal super key of the relational table R. List the derivations of all minimal keys. (ii) Identify the highest normal form of the relational R. Remember that the identification of a normal form requires analysis of the valid functional dependencies. (i) Decompose the relational table R into minimal number of normalized jii) relational tables in BCNF. Remember to indicate the primary key and foreign keys (if any).

Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. R(A,B, C, D, E, H) Functional Dependency: A → B, BC → D,E → C,D → A Find all the minimal super key of the relational table R. List the derivations of all minimal keys. (ii) Identify the highest normal form of the relational R. Remember that the identification of a normal form requires analysis of the valid functional dependencies. (i) Decompose the relational table R into minimal number of normalized jii) relational tables in BCNF. Remember to indicate the primary key and foreign keys (if any).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

For a relational schema R(ABCDEFG), Following dependencies are given to you i)Find out the prime and non-prime attributes.ii) Find out the highest normalization form of R
Consider the relation schema Appointment={Patient, GP, Date, Time, Clinic, Room} and the followingset Σ of FDs:• Patient, Clinic, Date → Time• Patient → GP• GP → Clinic• Clinic, Date, Time, Room → Patient• Patient, Date, Time → Clinic, RoomIs the above relation schema Appointment in BCNF? If not, identify a BCNF decomposition for Appointment. You need to include the main steps used for identifying the BCNF decomposition. Check ifthis BCNF decomposition is dependency preserving
Q7. Consider a database containing two relations: R(A,B,C) and S(D,E,F). For each of three (your choice) of the 12 rewriting rules for relational algebra expression, give an example pair of relational algebra expressions involving R and S such that the rule rewrites one expression to the other expression, and give another example pair to show the rewriting rule cannot be used since some of the conditions for the rule are not satisfied.
Consider the relation schema R (A, B, C, D) with all possible functional dependencies. For each of the following situations, identify the highest normal form for this relation R. A, C -> B, D C -> D A, C -> B, D B -> D A, C -> B, D
You are given a relation R with the following attributes R(A,B,C,D,E). Assume that you were given the following functional dependencies: • FD1= AB -> E • FD2: = D -> C (a) What is a valid key for this relation? justify your response. (b) Is this relation in 3NF (Third Normal Form)? Justify your response. If it is not in 3NF, normalize the relation and demonstrate all steps of normalization.
Let R be a relational schema with attributes {M, N, O, P, Q, R} and let F be the set of functional dependencies F = {MN→OP, O→Q, QR→N, R→P}. Prove whether R is in 3NF.
Give an SQL schema definition for the employee database of Figure 3.19.Choose an appropriate domain for each attribute and an appropriate primarykey for each relation schema. Include any foreign-key constraints that might beappropriate.
Please answer the following relational database question asap!! Consider the following relation schema R= {P, Q, S, T} and a set of functional dependencies Σ = {PQ->S, S->PQ, P->T}. Is R in the BCNF form with respect to Σ? If not, determine a BCNF decomposition for R and check if this BCNF decomposition is dependency-preserving.
Please answer this DBMS ques asap! Suppose that we have three relations R1={A, B, C}, R2={A, B, D} and R3={B, C, D} under the relational data model. The relation R1 has 5 tuples, the relation R2 has 6 tuples and the relation R3 has 7 tuples. There are no NULL values in these relations. For each of the following relational algebra expressions, list the minimum and maximum numbers of tuples in the result that the relational algebra expression may have. (1) πA,B(R1)(2) R2 × πB(R3)(3) πB(R2) ∪ πB(R3)(4) R1 ⋈ R2(5) ρX (R2) ⋈X.B≠Y.B ρY (R2) You can use the following format to organise your answers.(1) max=____ , min=____ ;(2) max=____ , min=____ ;(3) max=____ , min=____ ;(4) max=____ , min=____ ;(5) max=____ , min=____ ;
Consider the following relation with set of functional dependenciesR(ABCDEF)ABC->D, ABD->E, CD->F, CDF->B, BF->D a) Identify the candidate key(s) in the relation with proper steps pointwise followed. [Line by Line Detail Explanation] b) Identify which normal form this relation is in and reason for the answer. [Line by Line Detail Explanation] I need a proper long answer please... Thanks in advance...
Let R be a relational schema {A, B, C, D, E, F, G} and let F be the set of functional dependencies F = {AB→C, AC→B, BC→EG, AD→E, B→DG, BE→A, AE→CG}. Find the minimal cover.
So SQL does not suppor functional depency constraints. However, if the database system supports constraints on materialized views and materialized views are maintained immediately, is it possible to enforce the functional dependency constraints in SQL? If it is possible, for a relation r(A,B,C), how can the constraints on materialized views be used to enforce a functional dependency, like B->A?