<transcript><audio_124>the table scan so so what what's happening here in in step three is uh the the table scan operator of r is filling up this output buffer until it gets full if it's full uh then we want to emit the whole output buffer and return that that whole tuple</transcript><transcript><audio_125>batch back to uh the parent join operator here so we're going to do it kind of in these batches and then the same thing on the right side so once we're all done building up the the hash table during the uh build phase of our hash join</transcript><transcript><audio_126>um in the that fourth first for loop in operator two then we move on to the second uh second for loop in there and and basically for each for each probe uh we're not again emitting the tuple</transcript><transcript><audio_127>right away as soon as we find a match we're sticking in it in this output buffer until the full output buffer fills up and then we're going to return it and the same thing for the the selection in step four we're not emitting the tuple right away if it passes the predicate we're putting it in</transcript> the table scan so so what what's happening here in in step three is uh the the table scan operator of r is filling up this output buffer until it gets full if it's full uh then we want to emit the whole output buffer and return that that whole tuple batch back to uh the parent join operator here so we're going to do it kind of in these batches and then the same thing on the right side so once we're all done building up the the hash table during the uh build phase of our hash join um in the that fourth first for loop in operator two then we move on to the second uh second for loop in there and and basically for each for each probe uh we're not again emitting the tuple right away as soon as we find a match we're sticking in it in this output buffer until the full output buffer fills up and then we're going to return it and the same thing for the the selection in step four we're not emitting the tuple right away if it passes the predicate we're putting it in
{"source": "grass-yt-cc-by.0K0kI1H2KTE|shard_1004_48|create_multimodal_data.extract_yt_and_generate_transcripts.60|shard_1004|create_multimodal_data.generate_captions.50|shard_1004|create_multimodal_data.generate_captions.55", "params": {"id": "0K0kI1H2KTE", "channel_id": "UCHnBsf2rH-K7pn09rb3qvkA", "duration": 4701, "view_count": 4624, "age_limit": 0, "chapters": [{"start_time": 0.0, "title": "Introduction", "end_time": 108.0}, {"start_time": 108.0, "title": "Recap", "end_time": 278.0}, {"start_time": 278.0, "title": "Overview", "end_time": 435.0}, {"start_time": 435.0, "title": "Iterator", "end_time": 709.0}, {"start_time": 709.0, "title": "Runthrough", "end_time": 846.0}, {"start_time": 846.0, "title": "Iterator Approach", "end_time": 1104.0}, {"start_time": 1104.0, "title": "Materialization Approach", "end_time": 1581.0}, {"start_time": 1581.0, "title": "Vectorization Approach", "end_time": 2253.0}, {"start_time": 2253.0, "title": "Vectorization Model", "end_time": 2475.0}, {"start_time": 2475.0, "title": "Query Processing Models", "end_time": 2606.0}, {"start_time": 2606.0, "title": "Access Methods", "end_time": 2701.0}, {"start_time": 2701.0, "title": "Sequential Scan", "end_time": 2796.0}, {"start_time": 2796.0, "title": "Optimizations", "end_time": 2915.0}, {"start_time": 2915.0, "title": "Zone Maps", "end_time": 3180.0}, {"start_time": 3180.0, "title": "Late Materialization", "end_time": 3302.0}, {"start_time": 3302.0, "title": "Index Scan", "end_time": 3388.0}, {"start_time": 3388.0, "title": "Index Scan Example", "end_time": 3507.0}, {"start_time": 3507.0, "title": "Multiindex Scan Example", "end_time": 4701}], "like_count": 46, "channel_follower_count": 71100, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@CMUDatabaseGroup", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_1004/0K0kI1H2KTE.tar.gz"}}