edited by
1,999 views
1 votes
1 votes
If
- relation r has br blocks and nr records,
- relation s has bs blocks and ns records,
- memory can hold exactly one block of r and one block of s at any point in time,
then
what is the formula for number block accesses required to perform join (if relation r is the part of outer loop) using
(a) nested loop join
(b) blocked nested loop join
Also which book discusses this topic? And is it in syllabus for gate?
edited by

1 Answer

Best answer
7 votes
7 votes

BLOCK NESTED JOIN REDUCES THE OVERHEAD OF ACCESING MORE NUMBER OF RECORDS

Related questions

2 votes
2 votes
2 answers
1
Shubhanshu asked Aug 18, 2017
1,317 views
Consider a relation R with 2000 records and relation S with 500 records. Size of each record is 5 Byte and block size is 100 Byte, then minimum number of block access tha...
2 votes
2 votes
1 answer
2
rahul sharma 5 asked Jan 5, 2017
976 views
Say I have two tables and they have some attributes in common, assume x is common, now will x will appear once in the output or twice for following cases? Natural joinCro...
1 votes
1 votes
1 answer
3
Gaurangi Katiyar asked Jan 16, 2019
353 views
Let a relation R with n tuples occupying X blocks and relation S with m tuples occupying Y blocks. 5 blocks of main memory are allocated to store records of R and S to pe...
1 votes
1 votes
0 answers
4
Gaurangi Katiyar asked Dec 29, 2018
637 views