<transcript><audio_91>it's going to write them out into this output buffer called out and then once it's done we're going to return out up to the parent and then the same thing sort of the the you get all the tuples back all at once build the hash table and then sort of the same thing is going to happen</transcript><transcript><audio_92>on the right side so we have to go through here um this this table scan is going to produce all the output return it to the the selection and then so forth all the way up the query tree so this is kind of the the extreme</transcript><transcript><audio_93>opposite of like tuple at a time processing is operator to time processing so we do all of the uh the entire operation on every single tuple for that operator and then we're done with it and then we move on to the next operator so the question is when when would you want to do this i said</transcript><transcript><audio_94>kind of why the tuple tuple at a time iterator based processing was good so the the answer is that sometimes in uh oltp workloads because we're only accessing a small number of tuples at a</transcript> it's going to write them out into this output buffer called out and then once it's done we're going to return out up to the parent and then the same thing sort of the the you get all the tuples back all at once build the hash table and then sort of the same thing is going to happen on the right side so we have to go through here um this this table scan is going to produce all the output return it to the the selection and then so forth all the way up the query tree so this is kind of the the extreme opposite of like tuple at a time processing is operator to time processing so we do all of the uh the entire operation on every single tuple for that operator and then we're done with it and then we move on to the next operator so the question is when when would you want to do this i said kind of why the tuple tuple at a time iterator based processing was good so the the answer is that sometimes in uh oltp workloads because we're only accessing a small number of tuples at a
{"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"}}