Skip to content
lectern.tv
1/4

Database Storage II — Log-Structured Merge Trees (LSM) & Tuple Layout

Andy PavloDistinguishedCarnegie Mellon University

Associate Professor of Databaseology

1:17:25·2023·undergraduate level

Compares page-oriented B+Tree storage (PostgreSQL) against append-only Log-Structured Merge Trees (RocksDB, LevelDB, Cassandra), compaction strategies, and Bloom filters.

Systems & CSDatabase SystemsLSM TreesRocksDBCompaction

15-445/645 Intro to Database Systems (Fall 2023) Carnegie Mellon University

Source: CMU Database Group via YouTubeWatch on YouTube
LecturerAll lecturers →
Andy PavloDistinguished

Associate Professor of Databaseology, Carnegie Mellon University

Associate Professor of Computer Science at Carnegie Mellon whose 15-445 and 15-721 courses are the gold standard in database systems architecture.

3 courses · 58 lecturesCanon
Previous · Lecture 4

Database Storage I — Volatile vs. Non-Volatile Hierarchy & Slotted Pages

Next · Lecture 6

OLTP vs. OLAP Storage Models & Database Compression

Comments

Add a comment...Sign in