<transcript><audio_64>of how these these arrows look here on this right side every single tuple we emit is going to be pushed uh or pulled by up up by the parent operator uh all the way through the query plan so for</transcript><transcript><audio_65>as long as you know it it uh let's say it needs to end up the the tuple t that we omit and step five needs to end up in our result set it's going to be pulled through every next call all the way up through the entire query plan and what that's going to allow us to do is kind</transcript><transcript><audio_66>of maximize the locality of the of the data that we're working on so remember going in and getting a page and then getting the tuple from the page extracting it decoding and all that stuff is really expensive so</transcript><transcript><audio_67>basically what we want to do is maximize the amount of work we're able to perform on the tuple once we go and get it from disk so we're going to get the tuple we're going to try and propagate it or pipeline it as much as possible through all of the operators that we have in our query plan so that's that's</transcript> of how these these arrows look here on this right side every single tuple we emit is going to be pushed uh or pulled by up up by the parent operator uh all the way through the query plan so for as long as you know it it uh let's say it needs to end up the the tuple t that we omit and step five needs to end up in our result set it's going to be pulled through every next call all the way up through the entire query plan and what that's going to allow us to do is kind of maximize the locality of the of the data that we're working on so remember going in and getting a page and then getting the tuple from the page extracting it decoding and all that stuff is really expensive so basically what we want to do is maximize the amount of work we're able to perform on the tuple once we go and get it from disk so we're going to get the tuple we're going to try and propagate it or pipeline it as much as possible through all of the operators that we have in our query plan so that's that's
{"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"}}