B+Tree Indexes - Lecture 8
Offered By: CMU Database Group via YouTube
Course Description
Overview
Dive into an in-depth lecture on B+Tree Indexes, a crucial component of database systems. Learn from Carnegie Mellon University's renowned database expert, Andy Pavlo, as he explores the intricacies of this fundamental data structure. Gain insights into how B+Trees optimize database operations, improve query performance, and enable efficient data retrieval. Explore the structure, properties, and operations of B+Trees, understanding their role in modern database management systems. Access accompanying slides and notes for a comprehensive learning experience. Part of the 15-445/645 Intro to Database Systems course at Carnegie Mellon University, this lecture provides essential knowledge for aspiring database professionals and computer scientists.
Syllabus
F2023 #08 - B+Tree Indexes (CMU Intro to Database Systems)
Taught by
CMU Database Group
Related Courses
Intro to Computer ScienceUniversity of Virginia via Udacity Design of Computer Programs
Stanford University via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Algorithms, Part II
Princeton University via Coursera