CS4482tut4a - B joining them with tuples from s until B is...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS4482/6492 Advanced Database Systems Tutorial 4 1. (a) For b b = 1 Cost = 53,010 seconds. For b b = 100 Cost = 6,510 seconds. (b) b b = 9 (c) Cost = 8,566 seconds. 2. Using pipelining, output from the sorting operation on r is written to a buffer B at the final merge pass. When B is full, the merge-join processes tuples from
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: B , joining them with tuples from s until B is empty. At this point, the sorting operation is resumed and B is refilled. This process continues until the merge-join is complete. 3. hash-join Cost = 6,900 block transfers Memory = 30 blocks...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online