The Gateway to Computer Science Excellence
0 votes
110 views

Consider a relation R(A, B) that contains r tuples, and a relation S(B, C) that contains s tuples; assume r > 0 and s > 0. Make no assumptions about keys. For the following relational algebra expression, in terms of r and s the minimum and maximum number of tuples that could be in the result?

in Databases by (5 points) | 110 views
0
$r$ max

$0$ min

1 Answer

0 votes
case 1: if in R(a,b) and S(b,c) we have the same values of b then the inner parenthesis evaluates to 0 and then r-0=r(no of tuples in relation r)

case 2: if in R(a,b) and S(b,c) we have no tuple common so the inner bracket gives us r no of tuples and r-r=0

So max=r and min=0
by Loyal (5.7k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,317 answers
198,366 comments
105,088 users