<transcript><audio_106>essentially the entire uh output of of like a table scan right you if if my table is bigger than memory then i'm going to end up basically just re-materializing the output right so i mean you you probably</transcript><transcript><audio_107>rewrite those away at the end um and you get some kind of streaming access but i think the the the uh imagine a join right if i have to materialize the entire join outputs that means the the whole hash table side uh plus the build side plus on the probe side</transcript><transcript><audio_108>now for every match i have to emit those that can get pretty large so kind of you lose you lose i think whatever benefits you would get through prefetching by having to do now much more disk i o if you're larger than memory if you're in memory then sort of the the the question</transcript><transcript><audio_109>changes and that's why systems like monetb can have this this operator at a time processing model but if you're larger than memory i i can't think of a good uh way to do this that's not going to um</transcript><transcript><audio_110>kind of sabotage any advantages you get in that regard are there any other questions about</transcript> essentially the entire uh output of of like a table scan right you if if my table is bigger than memory then i'm going to end up basically just re-materializing the output right so i mean you you probably rewrite those away at the end um and you get some kind of streaming access but i think the the the uh imagine a join right if i have to materialize the entire join outputs that means the the whole hash table side uh plus the build side plus on the probe side now for every match i have to emit those that can get pretty large so kind of you lose you lose i think whatever benefits you would get through prefetching by having to do now much more disk i o if you're larger than memory if you're in memory then sort of the the the question changes and that's why systems like monetb can have this this operator at a time processing model but if you're larger than memory i i can't think of a good uh way to do this that's not going to um kind of sabotage any advantages you get in that regard are there any other questions about
{"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"}}