give correct option only. Consider the following instance of relation Sells(book_title, library, price):book_titleThe grand designBrief history of timeThe grand designBrief history of timeQuantum computersBrief history of timeSelect oneCa Books sold by more than one librarySellsOb Books sold by exactly one libraryOc Books sold by one library or more.Od Books not sold by any librarylibraryNouraNouraMalik'sMalik'sMalik'sAl DirasatWhat this query is trying to find?Select book title from sells s1 where EXISTS (select from sells where book title=s1.book title and library != s1.library)price20,00015,00018,00016,00025,00021,000

Consider the following instance of relation Sells(book title, library, price): book_title The grand design Brief history of time The grand design Brief history of time Quantum computers Brief history of time Select one O a b What this query is trying to find? Select book title from sells s1 where EXISTS (select from sells where book title=s1.book title and library != s1 library) Books sold by more than one library Books sold by exactly one library Books sold by one library or more. Sells Od Books not sold by any library library Noura Noura Malik's Malik's Malik's Al Dirasat price 20,000 15,000 18,000 16,000 25,000 21,000

Consider the following instance of relation Sells(book title, library, price): book_title The grand design Brief history of time The grand design Brief history of time Quantum computers Brief history of time Select one O a b What this query is trying to find? Select book title from sells s1 where EXISTS (select from sells where book title=s1.book title and library != s1 library) Books sold by more than one library Books sold by exactly one library Books sold by one library or more. Sells Od Books not sold by any library library Noura Noura Malik's Malik's Malik's Al Dirasat price 20,000 15,000 18,000 16,000 25,000 21,000

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

1. Given the followving relation that stores details about students' activities: ActivityFee AmountPaid 65.00 StudentID StudentName Activity Golf 100 Jones 65.00 100 Jones Skiing Skiing 200.00 0.00 200 Davis 200.00 0.00 200 Davis Swimming Skiing Swimming 50.00 50.00 50.00 300 Garrett 200.00 100.00 300 Garrett 50.00 400 Jones Golf 65.00 65.00 400 Swimming 50.00 Jones 50.00 If the functional dependencies are consistent with the above relation, put TRUE. If they are not, put FALSE. StudentID → StudentName StudentID , StudentName → Activity Activity > ActivityFee Activity → StudentID StudentID → Activity StudentID → AmountPaid ||
Convert the following Relation into INF, 2NF, and 3NF and show the functional dependencies. StudentID StudentName Major CourselD CourseTitle InstructorName InstructorLocation Grade D-Building A-Building C-Building C-Building A-Building D-Building A-Building 111 Kevin CS CS201 Bob Computer Marketing Accounting Accounting Jeff 111 Kevin CS МАЗ3 Jeff 111 Kevin CS АCC234 Sarah 222 Alex BA АСC234 Sarah B. 333 МАЗ33 Marketing Computer Marketing Noor MA 444 CS201 Bob Luay Adam BA A 555 AC МАЗ33 Jeff
Suppose you are given a relation grade_points(grade, points) that provides a conversion from letter grades in the takes relation to numeric scores; for example, an “A” grade could be specified to correspond to 4 points, an “A−” to 3.7 points, a “B+” to 3.3 points, a “B” to 3 points, and so on. The grade points earned by a student for a course offering (section) is defined as the number of credits for the course multiplied by the numeric points for the grade that the student received.Given the preceding relation, and our university schema, write each of thefollowing queries in SQL. You may assume for simplicity that no takes tuple has the null value for grade. Find the ID and the grade-point average of each student.
Suppose relations R(A,B) and S(B,C,D) are as follows: 3 5 A 1 R B 6 2 4 4 6 8 9 C 5 7 c. The full outer join has 3 NULLs. d. The left outer join has 4 NULLS. S A Compute the full outer join on B, the left outer join on B, and the right outer join on B. In each case, R is the left operand and S is the right operand. Then, answer the following questions for each of the three resu How many rows are there in the result? 2 How many NULL's appear in the result? Finally, find the correct statement in the list below. O a. The right outer join has 2 rows. Ob. The right outer join has no NULLS. D 1 2 3
Consider the following relation: CAR_SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discounted price). This relation refers to options installed in cars (e.g., cruise control) that were sold at a dealership, and the list and discounted prices of the options. If Carl D → Sale_date and Option_type → Option_listprice and {Carl D, Option_type} → Option_discountedprice, a) Argue using the generalized definition of the 3NF that this relation is not in 3NF. b) Argue from your knowledge of 2NF, why it is not even in 2NF.
A relation FarmVisit is defined below with attributes in the table headings. FarmVisit visitorID visitorName date farmID farmName t1 H001 John 1 Feb 2021 A10 Green Field t2 Н005 Ashley 1 Jan 2021 A10 Green Field t3 но05 Ashley 1 Feb 2021 A10 Green Field t4 H005 Ashley 15 Apr 2021 H02 Есо t5 Но06 Ashley 15 Apr 2021 A11 Green Field a) Write down examples of tuples (i.e., tl, t2) to show neither of the following is a functional dependency: (i) visitorID -> date (ii) date -> farmID b) Write down the functional dependency (FDs) using the above data, which can represent all possible data. The FDs should be non-trivial and the determinants of the FDs should contain minimal number of attributes required. c) Using the tuples given, can (visitorID, farmID) be the primary key of FarmVisit? Explain why. d) What the highest normal form by which the FarmVisit relation can be classified? Explain why.
Consider the following relation: TempID 111 222 333 444 555 666 TempName Joe Mike Sue Pat Bob Joe TemplD JobID J111 J222 J333 J444 J555 J666 TempName TEMP AGENCY Job TypelD T1 T2 T1 JobID T2 T1 T2 Job TypeDesc Bookkeepiing Answering calls Bookkeepiing Answering calls Bookkeepiing Answering calls • Each job has one job type, but multiple jobs can have the same job type • Each job is assigned to one employer. Same employer can have multiple jobs. 5a) In the figure below, indicate functional dependencies by drawing lines with arrows. -| Some of the requirements that this table is based on are as follows: • Each temporary worker has a unique TempID, and a non-unique TempName. • Each employer has a unique EID, and a non-unique EName. • Each job has a unique JobID, and a job type. • Each job type has a unique JobTypeID and a non-unique job type description (JobTypeDesc). • Each temporary worker is assigned to only one job. EID E1 E1 E2 E2 E2 E1 Job TypeID Job TypeDesc Ename Mid Bank Mid Bank…
Suppose a single relation (table) is used to record the information about students’ enrollment in courses. We assume that each student may enroll in more than one course and one course is assigned to one instructor. All questions below are based on the following ENROLLMENT unnormalized table. ENROLLMENT StudentID StuName CourseCode CourseName Grade CreditHr Instructor InstrOffice 1021234 Ali 1102 1201 Database Internet A B 3 3 Zaid Sumaiya 5.01 5.05 1024131 Amina 1201 1401 Internet Operating System C B 3 3 Sumaiya Abdullah 5.05 5.10 1. What would be the First Normal Form (1NF) relation? Identify the primary key. 2. Identify the functional dependencies represented by the attributes shown in the ENROLLMENT table. Label partial or transitive dependency where applicable.
HouseSale (houseID, agentID, dateSold, commissionRate, interestRate) Where: dateSold interestRate agentID → commission Rate houseID →dateSold What is the highest normal form that the above relation satisfies? Decomposition into BCNF:
Entity modeling is a top-down approach * that involves entities relationships tables foreign key classes هذا السؤال مطلوب
11 of 40 Consider the following Relation instance of Students: ID firstNamelastName GPA Address 123 Albertson Albertson 3.5 888 CDN 234 Mary Albertson 4.2 759 St. Catherine Est. 345 Smith Smith 2.9 105 Queen Mary 456 Theodore McDonald 3.7 208 Jean Talon West 567 Jean Mary 3.9 950 Des Laurentides 678 Junior Junior 4.1 326 St. Martin West How many records will be in the result of the following SQL Query? Select ID, firstName From Students S Where firstName = lastName and firstName NOT IN ( Select lastName From Students Where ID S.ID); Answer:
recurrence relation recurrence relationrecurrence relation