<transcript><audio_8>in in the exam guide i think there is a question about um whether or not there would be a a practice exam uh yeah we'll we will um uh put out a practice exam from one of the previous years</transcript><transcript><audio_9>by by tonight so you you'll have a chance to look at that in preparing for next week's midterm so again just just kind of remember you have to budget your time between the midterm studying for the midterm and the the project which is</transcript><transcript><audio_10>going to be due uh shortly thereafter so are there any questions about administrative stuff</transcript><transcript><audio_11>i just did a quick recap so we've talked about this in the past a query plan uh is basically uh this this collection of operators that we have in our dbms</transcript><transcript><audio_12>and they're arranged in a tree uh technically again it's a directed acyclic graph but for our purposes everything we're going to talk about is translate one of these sql queries in</transcript><transcript><audio_13>the way that the dbms is going to execute is by translating a sql query to some kind of um logical plan so the uh logical plan corresponding to the sql query shown on the slide is is</transcript> in in the exam guide i think there is a question about um whether or not there would be a a practice exam uh yeah we'll we will um uh put out a practice exam from one of the previous years by by tonight so you you'll have a chance to look at that in preparing for next week's midterm so again just just kind of remember you have to budget your time between the midterm studying for the midterm and the the project which is going to be due uh shortly thereafter so are there any questions about administrative stuff i just did a quick recap so we've talked about this in the past a query plan uh is basically uh this this collection of operators that we have in our dbms and they're arranged in a tree uh technically again it's a directed acyclic graph but for our purposes everything we're going to talk about is translate one of these sql queries in the way that the dbms is going to execute is by translating a sql query to some kind of um logical plan so the uh logical plan corresponding to the sql query shown on the slide is is
{"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"}}