What problem does it solve?
Indexing strategy removes slow or unreliable data access by helping you choose which indexes to add, how to structure them, and when to remove them so queries match access patterns without exploding write cost.
Core Features & Use Cases
- Index structure selection: Choose appropriate index types (B-tree, hash, bitmap, GIN/GiST, BRIN, LSM-tree) based on equality, range, prefix, contains, geospatial, and workload characteristics.
- Composite and covering design: Determine column order, INCLUDE/covering behavior, and when expression/filtered indexes are preferable to broad indexing.
- Portfolio trade-off governance: Evaluate storage, write amplification, lock/maintenance overhead, planner overhead, and monitor usage to keep only indexes that the system actually uses.
Quick Start
Use the indexing-strategy skill to design the set of indexes for your database workload, including choosing index types, composite column order, and which indexes to drop when they go unused.