Software Engineering Radio - the podcast for professional software developers

Episode 417: Alex Petrov on Database Storage Engines

Jul 16, 2020
Ask episode
Chapters
Transcript
Episode notes
1
Introduction
00:00 • 3min
2
Storage Engines in Data Bases
02:32 • 2min
3
Is There a Convergence of Data Base Components?
05:00 • 2min
4
Is It Harder to Use a Hash Map in a Database?
07:18 • 4min
5
Why Do We Need Data Bases?
11:42 • 2min
6
The Trees Versus Bee Trees
13:48 • 4min
7
Bina Research Trees Are Not a Good Fit for the Disk
17:25 • 4min
8
The Binder Research Tree, Part 2: Splits and Merges
21:09 • 2min
9
Is There a Difference Between Indexes and Tables?
23:25 • 5min
10
How to Create an Index by Zip Code
27:59 • 3min
11
Inter Systems Iris Data Platform Ready
31:25 • 3min
12
Copy on Right B Tree
34:45 • 3min
13
Is There a Data Base Storage Engine?
37:21 • 5min
14
Alisemtries Are Not Good for Reeds
42:36 • 2min
15
Is There a Difference Between Bee Trees and Elism Trees?
44:27 • 2min
16
The Mutability Art of B Plus Trees
46:13 • 4min
17
The Future of Data Base Storage Engines
49:48 • 4min
18
Iris Data Platform - The Fastest Way to Build Applications
53:50 • 2min