You have the table T = (name, ssn, phone number) representing a person. Each name is uniquely identified by ssn, but the same name can have multiple phone numbers. Suppose you break the tables into two tables T1=(name, ssn) and T2= (name, phone number) a) What are the candidate keys of T, T1, and T2, respectively?

You have the table T = (name, ssn, phone number) representing a person. Each name is uniquely identified by ssn, but the same name can have multiple phone numbers. Suppose you break the tables into two tables T1=(name, ssn) and T2= (name, phone number) a) What are the candidate keys of T, T1, and T2, respectively?

Np Ms Office 365/Excel 2016 I Ntermed

1st Edition

ISBN:9781337508841

Author:Carey

Publisher:Carey

Chapter3: Performing Calculations With Formulas And Functions

Section: Chapter Questions

Problem 3.13CP

See similar textbooks

Similar questions

Write a program that queries the world database to determine in which country the residents have the greatest life expectancy. Research how to accomplish a JOIN on two tables. Then write a program that queries the world database to list the population of the capitol city for any country in Asia.
What does an EXCEPT (MINUS) query care about operand order, while a UNION query doesn't?
Suppose an application programmer was supposed to write a query select * from r natural left outer join s; on relations r(A, B) and s(B, C), but instead wrote the query select * from r natural join s; a. Give sample data for r and s on which both queries would give the same result. b. Give sample data for r and s where the two queries would give different results, thereby exposing the error in the query.
+----+ +- --+- | id | firstname | lastname | spouse_id | +--- + 1 | Marty 2 | Jennifer 3 | Lorraine 4 | Biff 5 | George | McFly | Parker NULL | NULL | | | | McFly | Tannen | McFly 5 | NULL | | 3 | +----+
Consider the following SQL Query: SELECT FNAME, DNAME FROM EMP AS E, DEPT AS D WHERE E.DNO = D.DNUMBER AND D.DNAME='CCI' AND SALARY > 15000; Draw the initial query tree for the above SQL query, and then show how the query tree is optimized by applying the Heuristic Rules. (You need to show the tree after applying a rule).
The following SQL queries use the instances of R1 of "Reserves" the instances of B1 of "Boats", and the instances of S1 of "Sailors" relation. An instance R1 of Reserves bid 101 103 103 day 10/10/96 11/12/96 10/11/96 12/01/96 12/05/96 10/10/09 10/10/98 104 10/07/98 11/10/98 09/08/98 09/05/98 09/08/98 SIC 22 22 31 31 22 22 31 64 64 74 103 102 104 102 101 102 103 An instance B1 of Boats bid 101 102 103 bname Interlake Interlake Clipper Marine 104 bcolor blue red green red An instance S2 of Sailors SIG 28 31 21 44 26 58 22 22 29 29 22 32 2 64 21 74 85 95 71 sname yuppy Tubber guppy rusty Dustin Brutus Andy Horte Horatio Zorba Art Bob Amy rating 81 5 10 11 1 & |10|| El 3 115 age 35 155 135 135 45 33 25 135 18 25 635 46 1.If we wish to list out only the names and ratings of the sailors, we can write this in SQL statement as 2.Find out only the names and ages of sailors. 3.To find out the names and ratings of sailors with a rating above 8, we can combine two of the preceding queries as:…
Given the tables create table T (A int primary key, B int); create table U (C int primary key, A int, foreign key(A) references T(A) ); Table T contains 100 rows and table U contains 200 rows. A common mistake made by students is to do a join and assuming the database will supply the join predicate. A student does the query SELECT T.A, T.B, U.C FROM T, U; The student does not get an error message but gets a large result set. How many rows are in the result set?
2. Get the Groups As new students begin to arrive at college, each receives a unique ID number, 1 to n. Initially, the students do not know one another, and each has a different circle of friends. As the semester progresses, other groups of friends begin to form randomly. There will be three arrays, each aligned by an index. The first array will contain a queryType which will be either Friend or Total. The next two arrays, students1 and students2, will each contain a student ID. If the query type is Friend, the two students become friends. If the query type is Total, report the sum of the sizes of each group of friends for the two students.
Third normal form says: a. No nonkey columns depend on another nonkey column. b. Every column that's not part of the primary key is fully dependent on the primary key. c. Eliminate repeated fields. d. None of the above.
Develop a PL/SQL block that would go through all the employees from EMPLOYEES table who work in department id= 90 (there is suppose to be 3 employee who work in Department 90)- IN BEGIN END END SECTION; Execute 3 separate of SELECT statement one after the other. Each SELECT will pull first name. salary of each employee and store them in local variables.+ SELECT LOAD INTO v_firstname1, v_salarxlWHERE emrlexee.id=100 Then second WHERE emploxee.id3101+ SELECT first_name, salary INTO v_firstname2, v_salary2 Then third + SELECTSELECTI tirst.name, salary INTO v_firstname3, v_salary3 iin WHERE emploxee id=102 ..... You must now have 6 local variables. DECLARE all of them accordingly in DECLARE section and use them in BEGIN and END.+ Then add another SELECT statement in BEGIN-END to find company average salary SELECT xa(salary) INTO aKasal FROM EMPLOYEES; !!! Do not forget to create y avgsal local variable in DECLARE section.
Let's wa(k through a review of basic SQL syntax, using as an example the database that was mentionedearlier. This database has the following simple structure(* indicates a primary key):Courses: CourseID*, CourseName, TeacherIDTeachers: TeacherID*, TeacherNameStudents; StudentID*, StudentNameStudentCourses: CourseID*, StudentID*Using the above table, implement the following queries.Query 1: Student Enrollment Query 2: Teacher Class Size
Write a PL/SQL Function that accepts 4 integers, 2 representing the homeTeamID and visitorTeamID, and the other 2 representing the score for each team during a game : htscore and vtscore The function will determine which team won the match and return the teamID of the winning team. You can achive this by comparing htscore > or < then vtscore.. if htscore is bigger then return hteamID or else return vteamID. If the game was a tie (the 2 scores are the same value) return a 0.