F2023 #00 - Course Overview & Logistics (CMU Intro to Database Systems)
18:33CMU 15-445 #01: The Relational Model & Relational Algebra
1:16:43CMU 15-445 #02: Modern SQL — Window Functions, CTEs & Bag Semantics
1:15:50CMU 15-445 #03: Database Storage I — Volatile vs. Non-Volatile Hierarchy & Slotted Pages
1:19:10CMU 15-445 #04: Database Storage II — Log-Structured Merge Trees (LSM) & Tuple Layout
1:17:25CMU 15-445 #05: OLTP vs. OLAP Storage Models & Database Compression
1:23:25CMU 15-445 #06: Buffer Pool Managers, LRU-K Eviction & Direct I/O
1:22:44CMU 15-445 #07: Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)
1:18:45Lecture 8: B+Tree Indexes (15-445)
1:22:47Lecture 9: Index Concurrency Control (15-445)
1:19:59Lecture 10: Sorting & Aggregation Algorithms (15-445)
1:05:24Lecture 11: Join Algorithms (15-445)
1:15:15Lecture 12: Query Execution Part 1 (15-445)
1:18:33Lecture 13: Query Execution Part 2 (15-445)
1:16:20Lecture 14: Query Planning & Optimization (15-445)
1:18:54Lecture 15: Concurrency Control Theory (15-445)
1:08:40Lecture 16: Two-Phase Locking Concurrency Control (15-445)
1:20:49Lecture 17: Timestamp Ordering Concurrency Control (15-445)
1:22:01Lecture 18: Multi-Version Concurrency Control (15-445)
1:20:54Lecture 19: Database Logging (15-445)
1:23:20Lecture 20: Database Recovery (15-445)
1:24:06Lecture 21: Intro to Distributed Databases (15-445)
1:21:21Lecture 8: B+Tree Indexes (15-445)
This lecture dissects the architecture and operational mechanics of B+Tree indexes, focusing on their efficacy in database systems for efficient data retrieval and storage organization.
Andy Pavlo (https://www.cs.cmu.edu/~pavlo/)
Slides: https://15445.courses.cs.cmu.edu/fall2023/slides/08-trees.pdf
Notes: https://15445.courses.cs.cmu.edu/fall2023/notes/08-trees.pdf
CMU 15-445 #07: Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)
Next · Lecture 10Lecture 9: Index Concurrency Control (15-445)