subject

For each part of this problem you will need to construct a single SQL query which will check whether a certain condition holds on a specific instance of a relation, in the following way: your query should return an empty result if and only if the condition holds on the instance. (If the condition doesn't hold, your query should return something non-empty). Note our language here: the conditions that we specify cannot be proved to hold in general without knowing the externally-defined functional dependencies; so what we mean is, check whether they could hold in general for the relation, given a specific set of tuples. You may assume that there will be no NULL values in the tables, and you may assume that the relations are sets rather than multisets, but otherwise your query should work for general instances. (1) {A} is a superkey for a relation T (A, B, C, D). (2) The combinations of two attributes in the relation T (A, B, C, D) are each keys. (3) A tuple-generating dependency (TGD) between two relations A and B, having some shared attributes X1, ... , Xn, holds if, for every tuple ta in A, there is some tuple tb in B such that ta[X;] = tb[X;] for i = = 1,... n. In other words, for every distinct tuple in A, there must exist a corresponding tuple in B, which has the same values of shared attributes. Consider three tables Sailors(sid, sname, rating, age), Reserves(sid, bid, sname, bname, date) and Boats(bid, bname, color); Check for a TGD between Sailors and Reserves. (4) A multivalued dependency (MVD) is defined as follows: let R be a schema i. e. a set of attributes, and consider two sets of attributes X CR and Y CR. We say that a multivalued dependency (MVD), written: X + Y , holds on R if whenever there are two tuples tı, ta such that t1[X] = t2[X], there also exists a third tuple t3 such that: t3[X] = tı[X] = tz[X] t3 [Y] = tı[Y] t3[R\Y] = tz[R\Y] Note that R\Y is all the attributes in R that are not in Y, and that tz need not be distinct from tı or t2. Note especially that an MVD holds on an entire relation, meaning that any two tuples (in any order) in the relation should satisfy the above conditions if the MVD holds. To simply the problem, we assume R= {A, B, C, D, E), X = {A, B, C), Y = {C, D, E}. Hints: You need self-joins, nested SQL queries and Not Exist or Exists.

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 18:00
What is the first view you place in your drawing?
Answers: 1
question
Computers and Technology, 22.06.2019 20:10
Assume that minutes is an int variable whose value is 0 or positive. write an expression whose value is "undercooked" or "soft-boiled" or "medium-boiled" or "hard-boiled" or "overcooked" based on the value of minutes. in particular: if the value of minutes is less than 2 the expression's value is "undercooked"; 2-4 would be a "soft-boiled", 5-7 would be "medium-boiled", 8-11 would be "hard-boiled" and 12 or more would be a "overcooked".
Answers: 1
question
Computers and Technology, 22.06.2019 22:00
Researchers measured the data speeds for a particular smartphone carrier at 50 airports. the highest speed measured was 78.1 mbps. the complete list of 50 data speeds has a mean of x overbarequals16.11 mbps and a standard deviation of sequals18.65 mbps. a. what is the difference between carrier's highest data speed and the mean of all 50 data speeds? b. how many standard deviations is that [the difference found in part (a)]? c. convert the carrier's highest data speed to a z score. d. if we consider data speeds that convert to z scores between minus2 and 2 to be neither significantly low nor significantly high, is the carrier's highest data speed significant? a. the difference is nothing mbps.
Answers: 3
question
Computers and Technology, 23.06.2019 01:20
Me with this program in c++ ! computers represent color by combining sub-colors red, green, and blue (rgb). each sub-color's value can range from 0 to 255. thus (255, 0, 0) is bright red. (130, 0, 130) is a medium purple. (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (in other word, equal amounts of red, green, blue yield gray).given values for red, green, and blue, remove the gray part. ex: if the input is 130 50 130, the output is: 80 0 80. thus, find the smallest value, and then subtract it from all three values, thus removing the gray.
Answers: 3
You know the right answer?
For each part of this problem you will need to construct a single SQL query which will check whether...
Questions
question
Mathematics, 02.03.2021 09:50
question
Mathematics, 02.03.2021 09:50
Questions on the website: 13722367