Software Engineering Radio - the podcast for professional software developers Episode 485: Howard Chu on B+tree Data Structure in Depth
Nov 9, 2021
Chapters
Transcript
Episode notes
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
Introduction
00:00 • 3min
Using a Bin Research Tree
02:46 • 3min
Binary Tree Structure - Axeeni
05:46 • 1min
Why Do We Need a Binary Tree?
07:15 • 2min
How to Construct a Binary Tree?
09:02 • 2min
A Nod Can Only Have Two Branches
10:48 • 2min
What Is a Balance Tree?
12:49 • 2min
Re Balancing a Tree Structure
15:00 • 2min
Using a Binary Tree?
16:39 • 2min
What Is a Binding Factor?
19:03 • 2min
Logarithm of N Is the Order of the Number of Elements in a Structure Form of Notation
20:56 • 2min
Is It a Balance Tree or a Binary Tree?
22:51 • 2min
How to Write a Bee Tree
25:02 • 2min
The Basics of B Plus Tree Data Structures
26:41 • 4min
Using a B Plus Tree to Store the Data Values
30:12 • 2min
A Ts Wa Transparent, or Transparently Usable?
32:30 • 2min
Using a B Plus Tre Data Structure?
34:11 • 2min
Using a Data Base Engine Like Lm D B
36:27 • 2min
B Plush Tree
38:06 • 2min
Using B Plus Trees for Indexes?
39:42 • 2min
Do You Know How to Write a B Plus Tree?
41:27 • 2min
Is There Something Already There?
43:35 • 2min
The B Plush Tree
45:37 • 3min
Using a Lock Coupling in LMD B?
48:12 • 2min
How Do You Get Into Lock Conflicts?
50:22 • 3min
Do You Think There'll Be a Major Breakthrough in 2021?
53:38 • 2min
Page Sizes Will Increase
55:49 • 2min
Short Cut - A Project Management Tool for Software Teams
57:23 • 2min
Btre Plus - What's the Difference?
59:19 • 3min