B-tree Indexes in Databases Illustrated by IndexedDB and PostgreSQL
summary
Explains how B-tree indexes speed up database queries using IndexedDB and PostgreSQL. Covers when to index WHERE, ORDER BY, and foreign key columns; how to handle multiple search criteria and choose column order in composite indexes; and situations where indexes hurt performance plus mitigation strategies.
AI-written summary · about
chapters (15)
- 0:00Introduction
- 3:30Database indexes
- 7:03B-trees foundation
- 10:14B-tree page splits
- 13:10Query plans with EXPLAIN
- 17:28Memory vs disk
- 19:37Optimize with indexes
- 22:50Composite indexes
- 28:16B-tree insertions
- 31:30Insertion order impact
- 34:44Deletion and garbage
- 37:37Row updates
- 40:12Index tips
- 44:17Summary
- 45:02Q&A
related talks
45mB-Tree Indexes in Databases Illustrated with Spring Boot, PostgreSQL and JPA
53mAdvanced Indexing Techniques in PostgreSQL
40mnbtree Indexes in PostgreSQL: Useful New Features
27mDropping Into B-Trees
52mA Deep Dive into PostgreSQL Indexing
46mA Deep Dive Into PostgreSQL Indexing
45mA Deep Dive into PostgreSQL Indexing
37mRules of Indexing in PostgreSQL
