Computer Sciences > GATE 2014 SET-2 > Relational Algebra
Consider a join (relation algebra) between relations r(R) and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if
Correct : a
Similar Questions
Consider a database that has the relation schemas EMP (EmpId, EmpName, DepId), and DEPT(DeptName, DeptId). Note that the DepId can be permitted to be NULL in th...
Consider the following two relations, R(A,B) and S(A,C);
The total number of tuples obtained by evaluating the following expression σB<C(R ⨝R.A=S.AS) is...
The relation schema, Person(pid, city), describes the city of residence for every person uniquely identified by pid. The following relational algebra operators...
Total Unique Visitors
Loading......