Deep Dive into On-Disk Data Structures
summary
The talk explains why traditional on-disk B-tree structures (used in DBMSs and file systems) are being replaced by write-optimized on-disk structures such as LSM-trees to handle ever-growing data volumes. It compares B-trees and write-optimized approaches, showing how techniques that speed up writes (for example, LSM trees) can trade off some point-query performance compared with B-tree designs.
AI-written summary · about
related talks
45mThe Database: A Sophisticated and Special Data Structure
34mWhat We Talk About When We Talk About Disk IO
52mHow shit works: Databases
13mClosing the B+-tree vs. LSM-tree Write Amplification Gap on Modern Storage Hardware...
39mAn Introduction to B-trees and LSM-trees for DEVs and DevOps
01h 16mHow do to do research with Systems Researchers
48mA Deep Dive Into Database Internals
05mExploring Data Deduplication in LSM Tree-based Key-Value Stores (Work-in-Progress Report)