<transcript><audio_116>sizes to align with cache lines or with memory pages or something like that but basically the idea is that we want to batch up several tuples together in a single batch rather than just one</transcript><transcript><audio_117>can anyone think of what some of the exactly so the statement was that you</transcript><transcript><audio_118>avoid the overhead of function calls you get to kind of amortize the cost of a next function call over several tuples rather than having to do it for every single one you can kind of do it over several now again if you are in a situation where</transcript><transcript><audio_119>you're extremely disc bound or i o bound then the function call overhead you know probably doesn't matter very much but um if you're partially in memory or fully in memory then this kind of uh ammo amortization of</transcript><transcript><audio_120>the the next function call overhead over over batches of tuples can be a potentially big win so this is another way to get around sort of that that function call overhead that we saw with the just the</transcript><transcript><audio_121>so this is going to look uh kind of like a hybrid between the the um the iterator tuple at a time and the the materialization approach so again we have these output buffers but rather than being the entire</transcript> sizes to align with cache lines or with memory pages or something like that but basically the idea is that we want to batch up several tuples together in a single batch rather than just one can anyone think of what some of the exactly so the statement was that you avoid the overhead of function calls you get to kind of amortize the cost of a next function call over several tuples rather than having to do it for every single one you can kind of do it over several now again if you are in a situation where you're extremely disc bound or i o bound then the function call overhead you know probably doesn't matter very much but um if you're partially in memory or fully in memory then this kind of uh ammo amortization of the the next function call overhead over over batches of tuples can be a potentially big win so this is another way to get around sort of that that function call overhead that we saw with the just the so this is going to look uh kind of like a hybrid between the the um the iterator tuple at a time and the the materialization approach so again we have these output buffers but rather than being the entire
{"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"}}