Tree Indexes: B+Trees - Lecture 8
Offered By: CMU Database Group via YouTube
Course Description
Overview
Explore the fundamentals of tree indexes and B+Trees in this comprehensive lecture from Carnegie Mellon University's Intro to Database Systems course. Delve into the intricacies of database indexing structures as Professor Andy Pavlo guides you through the concepts, implementation, and optimization of B+Trees. Learn how these powerful data structures enhance database performance and efficiency. Access accompanying slides and notes for a deeper understanding of the topic. This 1 hour 22 minute video is part of the Fall 2024 15-445/645 course, offering valuable insights for database enthusiasts and computer science students alike.
Syllabus
#08 - Tree Indexes: B+Trees (CMU Intro to Database Systems)
Taught by
CMU Database Group
Related Courses
Data Structures and Algorithm Design Part II | 数据结构与算法设计(下)Tsinghua University via edX Hacking PostgreSQL: Data Access Methods
Ural Federal University via edX Ordered Data Structures
University of Illinois at Urbana-Champaign via Coursera I/O-efficient algorithms
EIT Digital via Coursera Data Structures and Algorithms (III)
Tsinghua University via Coursera