Published Apr 13, 2020
Designing Data-Intensive Applications - To B-Tree or not to B-Tree
Explore the intricate world of database indexing with a deep dive into the advantages of LSM Trees over B-Trees, discussing their write efficiency and disk space management for write-heavy environments, along with insights into database reliability mechanisms like write-ahead logs and concurrency management to ensure data integrity.
Topics covered
Popular Clips
Episode Highlights
Related Episodes
Designing Data-Intensive Applications - SSTables and LSM-Trees
Answers 383 questions
Data Structures - (some) Trees
Answers 383 questionsDesigning Data-Intensive Applications – Storage and Retrieval
Answers 383 questionsDesigning Data-Intensive Applications – Partitioning
Answers 383 questions
Designing Data-Intensive Applications - Reliability
Answers 383 questionsData Structures - Heaps and Tries
Answers 383 questionsDesigning Data-Intensive Applications – Lost Updates and Write Skew
Answers 383 questionsDesigning Data-Intensive Applications - Data Models: Relational vs Document
Answers 383 questionsDesigning Data-Intensive Applications – Leaderless Replication
Answers 383 questionsDesigning Data-Intensive Applications – Scalability
Answers 383 questionsDesigning Data-Intensive Applications – Data Models: Query Languages
Answers 383 questionsDesigning Data-Intensive Applications – Multi-Leader Replication
Answers 383 questionsDesigning Data-Intensive Applications – Multi-Object Transactions
Answers 383 questionsDesigning Data-Intensive Applications – Data Models: Relationships
Answers 383 questionsDesigning Data-Intensive Applications – Single Leader Replication
Answers 383 questions