Sort-Merge Join (cont)
Buffer requirements:
- for sort phase:
- as many as possible (remembering that cost is O(logN) )
- if insufficient buffers, sorting cost can dominate
- for merge phase:
- one output buffer for result
- one input buffer for relation R
- (preferably) enough buffers for longest run in S
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}