DATABASE SYSTEM CONCEPTS (LOOSELEAF)
7th Edition
ISBN: 9781260515046
Author: SILBERSCHATZ
Publisher: MCG
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
1. Consider the following relations:Student (snum: integer, sname: string, major: string, level: string, age: integer)Class (name: string, meets at: string, room: string, fid: integer)Enrolled (snum: integer, cname: string)Faculty (fid: integer, fname: string, deptid: integer)The meaning of these relations is straightforward; for example, Enrolled has onerecord per student-class pair such that the student is enrolled in the class. Level is atwo character code with 4 different values (example: Junior: A Level etc)Write the following queries in SQL. No duplicates should be printed in any of theanswers.i. Find the names of all Juniors (level = A Level) who are enrolled in a classtaught by Prof. Kwizeraii. ii. Find the names of all classes that either meet in room R128 or have five ormore Students enrolled.iii. Find the names of all students who are enrolled in two classes that meet atthe same time.
Suppose relations R(A,B) and S(B,C,D) are as follows
We have a relation with the following attributes: R={A,B,C,D,E} and all the attributes are atomic.
Primary key of this relation is AB. What is the normal form of this relation given the following functional dependencies:
AC→D, AB→C, AB→D, AB→E
Select one:
a. First Normal Form
b. This relation is not normal.
c. Third Normal Form
d. Second Normal Form
Chapter 3 Solutions
DATABASE SYSTEM CONCEPTS (LOOSELEAF)
Ch. 3 - Prob. 1PECh. 3 - Prob. 2PECh. 3 - Prob. 3PECh. 3 -
Suppose that we have a relation marks(ID, score)...Ch. 3 - Suppose that we have a relation marks(ID, score)...Ch. 3 -
The SQL like operator is case sensitive (in most...Ch. 3 - Prob. 7PECh. 3 - Prob. 8PECh. 3 - Prob. 9PECh. 3 - Prob. 10PE
Ch. 3 - Prob. 11ECh. 3 - Prob. 12ECh. 3 - Prob. 13ECh. 3 -
Consider the insurance database of Figure 3.17,...Ch. 3 - Prob. 15ECh. 3 - Prob. 16ECh. 3 - Prob. 17ECh. 3 - Prob. 18ECh. 3 -
List two reasons why null values might be...Ch. 3 - Prob. 20ECh. 3 - Prob. 21ECh. 3 - Prob. 22ECh. 3 - Prob. 23ECh. 3 - Prob. 24ECh. 3 - Prob. 25ECh. 3 - Prob. 26ECh. 3 - Using the university schema, write an SQL query to...Ch. 3 - Prob. 28ECh. 3 - Prob. 29ECh. 3 - Prob. 30ECh. 3 - Prob. 31ECh. 3 - Prob. 32ECh. 3 - Prob. 33ECh. 3 - Prob. 34ECh. 3 - Prob. 35E
Knowledge Booster
Similar questions
- Consider the following relations:Album (albumId: integer, title: string, artistId (FK): integer)Artist (artistId: integer, name: string)Composer (artistId: integer, name: string)Singer (artistId: integer, name: string)Write the following queries in relational algebra.(1) Find all the titles of the albums.(2) Find all the tuples whose albumId is 2.(3) Rename the relation Artist to Art and attributes to artId, title.(4) Find all the tuples that are either an Artist or a Composer.(5) Find the tuples of Artists who are not a Composer.(6) Find the tuples of people who are Composer and a Singer at the same time.(7) Find the titles of albums created by the artist ‘Black Sabbath’.arrow_forwardquestion one: defined the following relation on A={0,2,5,6} Answer each of the following questions by listing the index of the relation. For example, for Part 1), if R1 and R2 and are reflexive, simply enter 1, 2 as the answer.1) Which relations are reflexive? 2) R0={(0,6),(6,6),(6,2),(0,0),(0,2),(2,2),(5,5)} 3) R1={(6,6),(2,2),(5,5),(0,0),(0,6)} 4) R2={(0,6),(6,6),(0,0),(5,6),(6,5),(5,0),(5,5),(2,2),(0,5) 5) R3={(5,5),(0,0),(6,6),(2,2) 6) R4={(5,5),(6,2),(6,6),(0,0),(6,5),(2,6),(2,2)} 1) Which relations are reflexive? 2) Which relations are symmetric? 3) Which relations are anti-symmetric? 4) Which relations are transitive? 5) Which relations are equivalence relations? 6) Which relations are partial orders? question two :defined the following relation on A={0,1,5,6} Answer each of the following questions by listing the index of the relation. For example, for Part 1), if R1 and R2 and are reflexive, simply enter 1, 2 as the answer. R0={(5,5),(0,0),(6,6),(1,1)}…arrow_forwardConvert the following relation to 2NF, and then to 3NF. Show both conversions. (h, n, c, a, f, k, p, r, g, i, m, b, o, d, j, l, s, e) Functional Dependencies: p → j m, b → l h → g n → p n → o c → i n → j p → o h → d s → e a → rarrow_forward
- Consider a relation schema R = {A, B, C, D, E, G} and its functional dependency set F = {A → BCD,BC →DE,B → D,D → A}. Compute B+and choose the answer.(a) B+= AB(b) B+= ABC(c) B+= ABCD(d) B+= ABCDE(e) none of the abovearrow_forwardConsider the following relations: Employee(E_id: integer, E_name: string, Age: integer, Salary: real) Works(E_id: integer, Dep_id: integer, Start_date: date) Department(Dep_id: integer, Dep_name: string, Budget: real, Manager_E_id: integer) What referential integrity constraints exist between these relations? What are the options for enforcing these constraints when a user attempts to delete a Dept tuple?arrow_forwardConsider the Relation R4 = (A,C,B,D,E,F), with Functional Dependencies: A -> B, C -> D, E -> D. What is the Candidate Key for R4?arrow_forward
- Consider a relation named as BOOK that contains data about the books in a library. BOOK relation was initially created with the attributes BookID (an id that library assigns), ISBN, CopyNr (used to differentiate copies of the same book), Title, PublYear, Author, and AuthorBornYear. Primary key: BookID, CopyNr and Author Candidate key: ISBN, CopyNr and Author Below you see dependencies of attributes: Dependency 1 (D1): ISBN, Title, PublYear, AuthorBornYear were dependent on BookID, CopyNr and Author Dependency 2 (D2): Title and PublYear were dependent on BookID, CopyNr Dependency 3 (D3): AuthorBornYear was dependent on Author First determine which normal form (1NF, 2NF, 3NF or BCNF) the above relation is, and why. Then, if necessary, convert the above relation to the highest normal form (BCNF). Write any assumptions that you make.arrow_forwardConsider the following relation: Invoice(Order_ID, Order_Date, Customer_ID, Customer_Name,Customer_Address,Product_ID, Product_Desc, Price, Order_Quantity) FD1 - Order_ID -> Order_Date, Customer_ID, Customer_Name, Customer_Address FD2 - Customer_ID -> Customer_Name, Customer_Address FD3 - Product_ID -> Product_Description, Price FD4 - Order_ID, Product_ID -> Order_Quantity Give reasons to explain if this is in 3NF or not. If not, decompose it to 3NF.arrow_forward1. Consider a relation schema R1(A, B, C, D) that satisfies the set of functional dependencies F1 ={A→B, B→C, C→A}.a) Calculate A + and (AC)+b) Can AB→ C? Justify your answer.c) Find all the candidate keys of R1 using F1 and show your steps to find them. 2. Consider a relation schema R2(A, B, C, D) that satisfies the set of functional dependencies F2 = {A→B, C→D, D→AC}.a) Is (AD) is candidate key of R2? Justify your answer.b) Is R2 in BCNF? Explain the reason to your answer.c) If R2 is not in BCNF, give a lossless-join BCNF decomposition of R2. Is this decomposition dependency preserving? 3. Consider a relation schema R3(A, B, C, D, E) that satisfies the set of functional dependencies F3 = {A → BC, AC → BD}.a) Calculate (AC)+ and (AE)+b) Is AB → C in F3 +? Justify your answer.c) Find the canonical cover Fc of F3.d) Is R3 in 3NF? Explain the reason to your answer. If R3 is not in 3NF, give a lossless-join, dependency preserving 3NF decomposition of R3.arrow_forward
- I need help with the following Consider a STUDENT relation in a UNIVERSITY database with the followingattributes (Name, Ssn, Local_phone, Address, Cell_phone, Age, Gpa). Note thatthe cell phone may be from a different city and state (or province) from thelocal phone. A possible tuple of the relation is shown below:Name Ssn Local_phone Address Cell_phone Age GpaGeorge Shaw 123-45-6789 555-1234 123 Main St., 555-4321 19 3.75William Edwards Anytown, CA 94539a. Identify the critical missing information from the Local_phone andCell_phone attributes. (Hint: How do you call someone who lives in a dif ferent state or province?)b. Would you store this additional information in the Local_phone andCell_phone attributes or add new attributes to the schema for STUDENT?c. Consider the Name attribute. What are the advantages and disadvantagesof splitting this field from one attribute into three attributes (first name,middle name, and last name)?d. What general guideline would you recommend for…arrow_forward3) A relation is said to be in 3NF if it is in 2NF and no nonprime attribute of R is blank the primary key. A) an alternate forB) transitively dependent on C) Part of D) partially functionally dependent onE) fully funcionally dependent onarrow_forwardWhat does it mean to be related? How do you define a relation's properties?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 EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable 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