B-Tree Indexes in Databases Illustrated with Spring Boot, PostgreSQL and JPA
summary
Explains how standard B-tree indexes in PostgreSQL speed up queries and when to use them in Spring Boot / JPA applications. Covers indexing for WHERE, ORDER BY, and foreign keys, how to handle multiple search criteria and column order in composite indexes, and cases where indexes can slow performance and how to mitigate that impact.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 1:25Why indexes
- 7:54B-tree structure and pages
- 14:58Searching and balancing in B-tree
- 20:43Access speed and random reads
- 23:14Range search and optimization
- 27:07Unique and random ID problems
- 31:28Deletion and garbage in indexes
- 34:15Updating data and indexes
- 36:25Composite indexes and optimization
- 39:16When to create indexes
- 40:02Q&A
related talks
48mB-tree Indexes in Databases Illustrated by IndexedDB and PostgreSQL
53mAdvanced Indexing Techniques in PostgreSQL
27mDropping Into B-Trees
40mnbtree Indexes in PostgreSQL: Useful New Features
46mA Deep Dive Into PostgreSQL Indexing
52mA Deep Dive into PostgreSQL Indexing
37mRules of Indexing in PostgreSQL
45mA Deep Dive into PostgreSQL Indexing