
320 Big Data Computing
therefore, after joining with page p
3
they will advance one step in the queue.
Finally, the tuples w
3
have not joined with any disk pages and they will also
advance by one step in the queue after joining with page p
3
. Once the algo-
rithm completes the cycle of R, it again starts loading sequentially from the
rst page.
The MESHJOIN algorithm successfully amortizes the fast arrival rate of
the incoming stream by executing the join of disk pages with a large number
of stream tuples. However, there are still some further issues that exist in the
algorithm. Firstly, due to the sequential access of R, the algorithm reads the ...