• edited by
2,622 views
1 1 vote
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?

1 Answer

Best answer
7 7 votes

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

• selected by
Position:
Show:

Related questions

2 2 votes
2 2 answers
3.1k
3.1k views
Shubhanshu asked Aug 18, 2017
3,078 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 2 votes
1 answers 1 answer
1.4k
1.4k views
rahul sharma 5 asked Jan 5, 2017
1,370 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...
2 2 votes
1 1 answer
103
103 views
GO Classes asked Sep 14
103 views
Consider $\text{Postings(post, position, user, ptext)}$.Two aliases of this relation are used:$\text{P1 = Postings}$$\text{P2 = Postings}$Consider the query:SELECT count(...
0 0 votes
1 1 answer
228
228 views
Accord_Astro asked Apr 25, 2025
228 views
Question: Behavior of Natural Join with Common Attribute in Different DomainsSuppose there are two relations, R and S, and both have a common attribute named 'a'. However...