141 views
1 votes
1 votes
Consider the simple nested-loop join of the following two relations r and s.

   Relation   r  s
Tuples (n) 2400 1500
Blocks (b)   40  50

Assuming the worst case memory availability, i.e., the memory can hold only one block of each relation at a time, what is the number of block transfers and seeks?

Doubt: I am unable to find number of seek,Please guide?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
SidX asked Sep 26, 2021
466 views
Given a relation R(A, B, C, D, E, F, G, H) with keys BD and C and functional dependenciesD→G, E→F and H→C, decompose the R into the highest normal form possible.
4 votes
4 votes
4 answers
3
Anirudh Pandey asked Sep 19, 2017
1,331 views
If A Relation R(A,B,C,D) and CK given is (AB,C)and FD is given as A->C Then the relation is in which highest normal form?
0 votes
0 votes
1 answer
4
Akriti sood asked Jan 11, 2017
1,123 views
between B trees and B+ trees,which one is suited for random and which one is suited for sequential access??please explain