Modern Database Management (12th Edition)
12th Edition
ISBN: 9780133544619
Author: Jeffrey A. Hoffer, Ramesh Venkataraman, Heikki Topi
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 4, Problem 4.2RQ
Program Plan Intro
Matching the given terms and definition.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Here's a relation (R), its attributes and its functional dependencies (F):
R(A, B, C, D, E, F, G)
BC -> DG
CD -> F
FG -> A
1. compute the closure of {ACD}+
2. compute the closure of {F}+
3. what are the keys of R?
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.
Answer the given question with a proper explanation and step-by-step solution.
Chapter 4 Solutions
Modern Database Management (12th Edition)
Ch. 4 - Prob. 4.1RQCh. 4 - Prob. 4.2RQCh. 4 - Prob. 4.3RQCh. 4 - Describe the primary differences between the...Ch. 4 - Summarize six important properties of relations.Ch. 4 - Describe two properties that each candidate key...Ch. 4 - Describe the three types of anomalies that can...Ch. 4 - Demonstrate each of the anomaly types with an...Ch. 4 - Fill in the blanks in each of the following...Ch. 4 - What is a well-structured relation? Why are...
Ch. 4 - Prob. 4.11RQCh. 4 - Describe how the following components of an E-R...Ch. 4 - Prob. 4.13RQCh. 4 - Prob. 4.14RQCh. 4 - Briefly describe four typical problems that often...Ch. 4 - Prob. 4.16RQCh. 4 - Explain how each of the following types of...Ch. 4 - Prob. 4.18RQCh. 4 - Prob. 4.19RQCh. 4 - Prob. 4.20RQCh. 4 - Prob. 4.21RQCh. 4 - What is the relationship between the primary key...Ch. 4 - Prob. 4.23RQCh. 4 - Explain what can be done with primary keys to...Ch. 4 - Prob. 4.25RQCh. 4 - Explain three conditions that suggest a surrogate...Ch. 4 - Prob. 4.27RQCh. 4 - For each of the following E-R diagrams from...Ch. 4 - Prob. 4.29PAECh. 4 - Prob. 4.30PAECh. 4 - For your answers to the following Problems and...Ch. 4 - Figure 4-3212 shows a class list for Millennium...Ch. 4 - Prob. 4.33PAECh. 4 - Prob. 4.34PAECh. 4 - Prob. 4.35PAECh. 4 - Prob. 4.36PAECh. 4 - Prob. 4.37PAECh. 4 - Prob. 4.38PAECh. 4 - For your answers to the following Problems and...Ch. 4 - Transform Figure 2-15a, attribute version, to 3NF...Ch. 4 - Prob. 4.41PAECh. 4 - Prob. 4.42PAECh. 4 - Prob. 4.43PAECh. 4 - Prob. 4.44PAECh. 4 - For your answers to Problem and Exercise 3-33 from...Ch. 4 - Prob. 4.46PAECh. 4 - Prob. 4.47PAECh. 4 - Figure 4-38 includes an EER diagram for a...Ch. 4 - Prob. 4.49PAECh. 4 - Prob. 4.50PAECh. 4 - Prob. 4.51PAECh. 4 - Prob. 4.52PAECh. 4 - Figure 4-40 shows an EER diagram for a university...Ch. 4 - Explore the data included in Table 4-9. Assume...Ch. 4 - Prob. 4.55PAECh. 4 - Prob. 4.56PAECh. 4 - Prob. 4.57PAECh. 4 - Prob. 4.58PAE
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Consider the relation instance and functional dependencies below. Which of these FDs hold on the instance and which do not? A BC 2 4 АВ — С A → B A → C В > с АС — В ВС — А 3 4 В > А C → A C → B 1 3 5 2 4arrow_forwardPlease help me answer the following questionsarrow_forward1. Consider the following relation: BIKE_SALE(Bike_ID, Salesperson_ID, Date_Sold , Sale_Commission, Discount_Percentage) Assume that a motorbike may be sold by multiple Salesperson, and hence {Bike_ID, Salesperson_ID} is the primary key. Additional dependencies are: • Bike_ID → Date_Sold • Bike_ID → Discount_Percentage • Date_Sold > Discount_Percentage • Salesperson_ID → Sale_Commission Identify if this relation is in 1NF, 2NF, 3NF? Please specify your reasons and normalize if you think it is needed.arrow_forward
- Given relation R(u, y, c, d, e, f, w) where there are two keys: {y,c} and {w}. Given a set of functional dependencies F = {fd1: {y,c} -> {u,d,e,f,w}, fd2: u -> c, fd3: w -> {u,y,c,d,e,f}}. Is R in 3NF? Explain why.arrow_forwardSelect all binary relation properties that apply to the following relation: Equal magnitude: |x| = lyl O antisymmetric O reflexive O symmetric O transitivearrow_forwardAn ID-dependent Weak Entity typically result in a table with a compound primary key with at least one part of the PK also being a foreign key T or Farrow_forward
- Consider the universal relation: R = (A, B, C, D, E, F, G, H, I, J) and the set of functional dependencies: A, B -> C B, D -> E, F A, D -> G, H A -> I H -> J What is the key for R? And Decompose R into 2NF, and then into 3NF relations.arrow_forwardGiven the reation R (A, B, C, D , E), with functional dependencies: A, B -> C D, E -> C B -> D Could you explain why this is not functional dependency preserving? Also could you work out the BCNF for this?arrow_forwardPlease answer the questionarrow_forward
- Give an example of how one non-key property depends on another non-key attribute to function?arrow_forwardConsider the relation schema R(A, B, C, D, E, F) and the set S = {AB->C, BC->AD, D->E, C->B) of functional dependencies. Assuming that R is decomposed into the relation schemas R1(A,B), R2(B,C), R3(A,B,D,E) and R4(E,F). Use the Chase test to show if this is a lossless decomposition.arrow_forwardDefined the relational algebra operations as follows: SELECT (p, R) is equivalent to σp(R) referring to a set tuples of relation R that conforms to predicate p. PROJECT(L, R) is equivalent to πL(R) referring to a relation that contains a vertical subset of R, extracting the values of specified attributes L and eliminating duplicates. JOIN (R, p, S) refers to a relation containing a combination of tuples of relations R and S that satisfy the join condition p. FULL_JOIN (R, p, S) refers to a relation containing the result of outer join between relations R and S that satisfy the join condition p LEFT_JOIN (R, p, S) refers to a relation containing the result of left outer join between relations R and S that satisfy the join condition p RIGHT_JOIN (R, p, S) refers to a relation containing the result of right outer join between relations R and S that satisfy the join condition p CROSS (R, S) refers to a relation containing the catesian product of relations R and S. UNION (R, S)…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education