<transcript><audio_15>logical plan and then the logical plan is then going to be translated again to a physical plan and the physical plan is where we take uh each of the operators and we decide which what the physical implementation of that operator is going to be so for example</transcript><transcript><audio_16>uh in this this join operator here that joins r and s together uh we need to decide how we're going to do that we're going to use um a nested loop join are we going to use uh hash join sort merge join that kind of stuff so we're starting out with this high-level</transcript><transcript><audio_17>logical plan and we need to translate that to the actual physical implementation of the operators that are going to to execute the plan so again the way we want to think about this is that data the data in our database is flowing from</transcript><transcript><audio_18>the leaves of the tree so at the bottom we see a table scan on r and s so the the data is going to flow from the leaves of the tree all the way up towards the root and then once you get to the root the root is going to materialize the final um</transcript><transcript><audio_19>query output that we're expecting so in this case we're going to get back the results from the the select clause uh the rid and the the s dot c date that that we requested in the query so kind of that's that's uh thinking about what we're doing at a high level</transcript> logical plan and then the logical plan is then going to be translated again to a physical plan and the physical plan is where we take uh each of the operators and we decide which what the physical implementation of that operator is going to be so for example uh in this this join operator here that joins r and s together uh we need to decide how we're going to do that we're going to use um a nested loop join are we going to use uh hash join sort merge join that kind of stuff so we're starting out with this high-level logical plan and we need to translate that to the actual physical implementation of the operators that are going to to execute the plan so again the way we want to think about this is that data the data in our database is flowing from the leaves of the tree so at the bottom we see a table scan on r and s so the the data is going to flow from the leaves of the tree all the way up towards the root and then once you get to the root the root is going to materialize the final um query output that we're expecting so in this case we're going to get back the results from the the select clause uh the rid and the the s dot c date that that we requested in the query so kind of that's that's uh thinking about what we're doing at a high level
{"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"}}