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

Let R be a relation on A = {0, 1, 6, 8} and R = {(0,0), (8, 6), (6, 6), (8, 8), (1, 1), (1,0), (0, 1)}. Are the following statements true or false? 1. R is symmetric ? ? ? ? ? ? V V 2. R is transitive 3. R is reflexive 4. R is an equivalence relation 5. R is anti-symmetric 6. R is a partial order
7. For the following recurrence relation: T(n) express T(n) using the e-notation. if n = 1 2T(n-1)+c, if n > 1,
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)
Let Q be a relation with attributes ABCD. Consider the SQL conjunc- tive query select v.A, t.B, v.D from Q v, Q w, Q t where v.D = w.D and t.D = 8 and t.A = w.A and v.C = t.B and w.A = 0 (i) Construct the pattern corresponding to the query. (ii) Is the pattern constructed in (i) minimal? (Explain) (ii) applied to databases satisfying the FD's Minimize the pattern in (i) knowing that the query is only С + В, АВ — D, A + С. Show the intermediate steps. Construct from the minimized pattern a corresponding min- (iii). imized SQL query.
Consider the following scenario: you have a relation that contains x, y coordinates, and the names of eateries. Assume, further, that the only questions that will be asked will be of the following types. The query specifies a location and inquires as to whether or not there is a restaurant located exactly at that location. If you were to choose between R-Tree and B-tree, which one would you choose? Why?
Consider a relation r (A,B,C,D). If we wanted to generate the information produced by select A, B, C, count(D) from r group by cube (A,B,C) using several queries none of which use "cube" nor "rollup" and none of which have subqueries how many distinct select/from expressions would be needed?
3
The recurrence relation of the divide phase of merge function is T(n)=2T(n/2) and merge as O(n). The illustration for the divide phase is shown below. If the recurrence relation is to be made as T(n)=4T(n/2) and merge as O(logn), would this be better or worse than the original merge function? Why(please explainin detail)? Please also provide the illustration for the divide phase of the modified merge function.
What is the output of an operation that begins with the execution of a Cartesian product of student and adviser and then continues with a selection operation on the result using the predicate s id = ID? Using the symbolic notation of relational algebra, this query may be expressed as s id=ID if it is given in that format (student advisor).