949 views
0 votes
0 votes

Consider a relation r1(ABC), r2(CDE) and r3(EG) with primary keys A, C and E respectively. Assume that r1 has 1000 tuples, r2 has 1500 tuples and r3 has 750 tuples. The number of resultant tuple in are

 

1 Answer

1 votes
1 votes
Since it will be a natural join among them, therefore on the basis of common attribute.(but ,since the is a patent child relation between the common attribute and parent is a primary key therefore this will be an interesting case)

So first let's take r1 and r2

           Since, r2 have C as primary key therefore r1 cross r2 will have 1000 elements. Since if parent child relation exist therefore all the child's table rows of them will be taken.(your can check it via manually it's interesting)

Therefore now (ABCDE) cross r3

           Similarly, 1000 is the answer.
edited by

Related questions

388
views
0 answers
0 votes
sikkaBrown asked Jun 10, 2023
388 views
(a) Draw the precedence graph with the following precedence relation: S1→ S2; S1→ S3; S1→ S4; S2 → S5; S3→ S5; S4 → S6; S5 → S6 Now suppose that ... explain why? (ii) How can this precedence graph be expressed if semaphores are also used?
377
views
0 answers
0 votes
sikkaBrown asked Dec 18, 2022
377 views
(a) Corresponding to the following reservation table, draw the state diagram. Clearly indicate the collision vectors, collision matrices, state transition diagram, and MALS 01234S1AB ABS2 A A S3B AB A