Suppose relation R(a,b,c) has the following tuples: (1,1,3), (1,2,3), (2,1,4), (2,3,5), (2,4,1), (3,2,4), and (3,3,6). Determine the result of the following query: SELECT V.d, SUM(V.c) FROM (SELECT a+b AS d, R.c GROUP BY V.d HAVING COUNT(*) <> 1; Which of the following tuples is in the result set? O a. (3, 12) O b. (3,6) FROM R)AS V O c. (5, 7) O d. (6, 7)

Suppose relation R(a,b,c) has the following tuples: (1,1,3), (1,2,3), (2,1,4), (2,3,5), (2,4,1), (3,2,4), and (3,3,6). Determine the result of the following query: SELECT V.d, SUM(V.c) FROM (SELECT a+b AS d, R.c GROUP BY V.d HAVING COUNT(*) <> 1; Which of the following tuples is in the result set? O a. (3, 12) O b. (3,6) FROM R)AS V O c. (5, 7) O d. (6, 7)

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

Definition (hints): a b(mod m), read "a is congruent to b mod m," if m|(a - b); that is, %3D (a - b) mod m = 0. %3D This is a correct adjacency matrix for the congruence mod 5 relation on the set (0, 1, 2, 3, 4, 5, 6, 7, 8, 9} 2 3 4 5 6 7 8 1 O. 2. 1 O 1 1 4 O. 1. 1 O. 7 1 6. 1. O True O False 3. 6.
Give pseudocode for computing a join: r ⋈r.A=s.A s using a single MapReduce step, assuming that the map() function is invoked on each tuple of r and s. Assume that the map() function can find the name of the relation using context.relname().
The following two relations R and S have one attribute storing integers. Assume that a join is performed on this attribute. R = { 4, 3, 1, 6, 2, 9, 0, 5, 8, 7 } S = { 3, 4, 5, 8, 0, 2, 1, 6, 7, 9} Show the order of tuples output for the following join algorithms: (for example Sort Join would give (0,0), (1,1),...,(9,9) ) 1.One pass join where M=12 and R is put in memory: 2.Merge-sort-join with M=5: 3.Hash Join with three buckets and M=4. Assume R is the build relation and S is the probe relation. Also assume bucket 0 is output first. Output:
The table R(x,y) currently has the following tuples (note there are duplicates): (1,2), (1,2), (2,3), (3,4), (3,4), (4,1), (4,1), (4,1), (4,2). Compute the result of the query: SELECT R1.x, R2.y, COUNT(*) FROM R R1, R R2 WHERE R1.y = R2.x GROUP BY R1.x, R2.y; Which of the following tuples is in the result? O a. (3, 4, 6) O b. (3, 2, 6) O c. (3, 2, 2) O d. (4, 3, 2)
Suppose you want to get answers to r ⋈ s sorted on an attribute of r, andwant only the top K answers for some relatively small K. Give a good way ofevaluating the query:When the join is on a foreign key of r referencing s, where the foreign key attribute is declared to be not null.
For each of the following pairs of expressions, give instances of relations thatshow the expressions are not equivalent. ΠA(r − s) and ΠA(r) − ΠA(s).
Modify the recursive query in Figure 5.16 to define a relationprereq_depth(course_id, prereq_id, depth) where the attribute depth indicates how many levels of intermediate prerequisites there are between the course and the prerequisite. Direct prerequisites havea depth of 0. Note that a prerequisite course may have multiple depths and thusmay appear more than once.
Relation R has schema R(a,b,c). In the result of the query SELECT a, b, c FROM R ORDER BY DESC, b ASC What condition must a tuple t satisfy so that i necessarily precedes the tuple (5,5,5)? Identify one such tuple from the list below. O a. (8, 6, 5) O b. (5, 5, 6) O c. (7, 5, 5) O d. (0, 9, 5)
Which of the following relations define functions? Select all that apply. Consider the set S = (1, 2, 3, 4) and let R be the relation on Sx S. R = {(1, 1), (2, 3), (4, 3)). Consider the set S = (1, 2, 3) and let R be the relation on Sx S, R = {(1, 1), (2, 3). (1, 3)). Let R₁ be the relation on Zx Z, R₁ = {(x,y) | xe Z and x < yl, where Z denotes the set of integers. Consider the sets S₁ = (1, 2, 3, 4) and S₂ = (3, 4, 5) and let R be the relation on S₁ x S₂, R = {(1, 3), (2, 5), (4, 5)}.
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).
If we had another relation, staff, which was union compatible with faculty, what would the following expression return for a result? Πempno (Staff ⋃ Instructor) Select one: a. The employee number of every staff employee and every instructor b. Every employee who is either a member of the staff or an instructor c. All tuples of the instructor relation along with all tuples of the staff relation d. The employee number of all rows in the staff and in the instructor relations
Consider the following five relations on the set A = {1, 2, 3, 4}. Determine which of the * .relations are reflexive R2 = {(1, 1)(1, 2), (2, 1), (2, 2), (3, 3), (4, 4)} R4 = A x A R1 = {(1, 1), (1, 2), (2, 3), (1, 3), (4, 4)} R3 = {(1, 3), (2, 1)}