edited by
496 views
1 votes
1 votes
Let $R(A,B,C)$ be a relation with primary key $(A)$ and $S(A, D, E)$ a relation with primary key $(A, D)$. Each of the relations has $n$ tuples. If the number of tuples in $R \: \text{ natural join } S$ is $m$, then determine the number of tuples in $R$ $\text{ natural left outer join } S$.
edited by

2 Answers

2 votes
2 votes
Since there are $\text{m}$ rows in the natural join of R and S which contains the common elements. Left outer join of R and S will contain common elements of R, S and left over elements of R which will be $\text{(n-m)}$

Hence total no. of rows in $\text{R left outer join S = m + (n-m)} \\\ = n$
0 votes
0 votes
It's simple there will be n tuples in which m tuples will related will relation S remaining (n-m) tuples wll not be related they will contain Null in the attribute of relation S

Related questions

0 votes
0 votes
2 answers
3
go_editor asked Sep 20, 2018
405 views
Write a complete ANSI C code using recursion to calculate the $sum(s)$ of the digits of an integer number (i) consisting of maximum 5 digits. For example, (1) = if $i=123...
1 votes
1 votes
1 answer
4
go_editor asked Sep 20, 2018
1,620 views
An operating system contains three resource classes. The number of resource units in these classes are $7, 7\ \text{and} \ 10$ respectively. The current resource allocati...