Assume that R and S are relations containing n R and n S tuples, respectively. What is the maximum and minimum number of tuples that can possibly be in the result of each of the following expressions (assuming appropriate union compatibilities)?

a. R ? S
b. R ? S
c. R ? S
d. R × S
e. R  S
f. R / S
g. ?s=4(R) × ?s,t(S)


a. Maximum number of tuples: (nR + nS);
Minimum number of tuples: max(nR, nS).

b. Maximum number of tuples: min(nR, nS);
Minimum number of tuples: 0.

c. Maximum number of tuples: nR;
Minimum number of tuples: 0.

d. Maximum number of tuples: nR x nS;
Minimum number of tuples: nR x nS.

e. Maximum number of tuples: nR x nS;
Minimum number of tuples: 0.

f. Maximum number of tuples: nR / nS;
Minimum number of tuples: 0.

g. Maximum number of tuples: nR x nS;
Minimum number of tuples: 0. (Selection can be empty.)

Computer Science & Information Technology

You might also like to view...

You can use spreadsheets for simple or complex calculations.

Answer the following statement true (T) or false (F)

Computer Science & Information Technology

When a viewer enters information on a form, it is visible to others unless it is ________

Fill in the blank(s) with correct word

Computer Science & Information Technology

Which of the following options means that if a record on the "one" side of one-to-many relationship is deleted, all records in the "many" table are also deleted?

A. Cascade Repeat Values B. Cascade Application Parts C. Cascade Delete Related Records D. Cascade Delete Related Fields

Computer Science & Information Technology

A class method is indicated by the word ____ in the method definition.

A. private B. public C. class D. static

Computer Science & Information Technology