Example Block based nested loop join – algorithm does not depends upon number of available buffers M, but performance depends. For each M-1 blocks of
{"Image DocumentName": "ExampleBlock based nested loop join \u2013 algorithm does not depends upon number of available buffers M, but performance depends.", "Image ImageDescription": "For each M-1 blocks of outer loop relation S, read blocks in main memory, organize the tuple into search structure where key is the common attribute between R and S. Now for each block b of inner loop relation R, read b into main memory and for each tuple t of b find tuples in S that join with t. The S uses M-1 buffers and it depends upon average number of buffers available at each iteration. One buffer is reserved for R. If we pin M-1 block that we use for S in one iteration of outer loop then we cannot loose these buffers during that round. If more buffers will become available then more blocks of R can be kept in the memory. Will it improve the running time?", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}