in Databases
146 views
1 vote
1 vote
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?
in Databases
146 views

Please log in or register to answer this question.

Related questions