<transcript><audio_95>time uh it it might be beneficial to do this kind of materialization approach so if we know we're only going to get a small number of tuples we want to get all the way down to the scan and we want to kind</transcript><transcript><audio_96>of fill up uh the entire while we're accessing the table we want to get all the tuples that we're possibly going to need from the table and then be able to push them up to the parent operator so you're kind of uh optimizing the the accesses and the operations that you're performing on</transcript><transcript><audio_97>each tuple it's it's much more streamlined than having to you know recursively sort of call these next functions and traverse those for every single uh tuple you wanna you wanna uh execute so the the the the advantage they are in</transcript><transcript><audio_98>something like a high performance system um uh volt db uh which uh andy actually worked on the uh the the predecessor the academic predecessor each store uh when he was in graduate school and then they commercialized it</transcript><transcript><audio_99>as fault db but kind of this is the um uh one way that you can strip out a lot of the overhead of having these next function calls voltdb is an in-memory system so the overhead of having all these function calls can kind of adds up we've talked a little</transcript> time uh it it might be beneficial to do this kind of materialization approach so if we know we're only going to get a small number of tuples we want to get all the way down to the scan and we want to kind of fill up uh the entire while we're accessing the table we want to get all the tuples that we're possibly going to need from the table and then be able to push them up to the parent operator so you're kind of uh optimizing the the accesses and the operations that you're performing on each tuple it's it's much more streamlined than having to you know recursively sort of call these next functions and traverse those for every single uh tuple you wanna you wanna uh execute so the the the the advantage they are in something like a high performance system um uh volt db uh which uh andy actually worked on the uh the the predecessor the academic predecessor each store uh when he was in graduate school and then they commercialized it as fault db but kind of this is the um uh one way that you can strip out a lot of the overhead of having these next function calls voltdb is an in-memory system so the overhead of having all these function calls can kind of adds up we've talked a little
{"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"}}