MySQL Indexing Best Practices
summary
Explains how MySQL uses B+tree-style indexes (point lookups, open/closed ranges, ORDER BY) and why InnoDB’s clustered primary key matters; shows when multi-column indexes work, why covering index and prefix indexes convert random I/O to sequential I/O, and why extra indexes cost writes, memory and optimizer confusion. Covers MySQL 5.6 features like InnoDB condition pushdown, JSON EXPLAIN output, join-buffer and union/enum tricks, and recommends combining columns, measuring with EXPLAIN and Percona tools.
AI-written summary · about
chapters (22)
- 0:00MySQL indexing importance
- 1:23What indexes are
- 3:33B+ tree indexes in MySQL
- 8:42Queries B+ tree indexes optimize
- 11:53Index overhead and best practices
- 13:19InnoDB clustered indexes
- 15:53Indexes for lookups
- 17:19Multi-column indexes behavior
- 20:57Indexes for sorting data
- 24:10Covering indexes benefits
- 26:21Min/Max with indexes
- 27:10Indexing joins
- 30:18Index merge limitations
- 31:22Prefix indexes trade-offs
- 33:09MySQL 5.6 optimizations
- 33:51Index condition pushdown
- 36:45How MySQL selects indexes
- 37:50EXPLAIN for optimization
- 39:23Holistic indexing strategy
- 40:47Practical indexing tips
- 43:04Advanced indexing tricks
- 45:38Q&A
related talks
36mFor performance, go to page 5: Indexes
42mThings every developer absolutely, positively needs to know about database indexing
46mSupercharge Your SQL with Indexes: a Practical Introduction
34mMySQL and InnoDB Performance for the Rest of Us
30mMySQL Indexes and Histograms to Speed Up Your Queries
48mMySQL Indexing - Do It Right or Die
01h 05mWorking with Indexes — Best Practices for MySQL 5.6
01mHow well do you know your MySQL Indexes?