Database Index Prefix Planner
Analyze B-tree leftmost equality prefixes, one range column, order prefix and covering columns. Equality columns may occur in any order within the prefix; index columns allow ASC/DESC (default ASC), with a fully reversed scan allowed. No costs, selectivity, expressions, partial indexes or database execution. At most 100 queries × 100 indexes, 20 index columns.
Enabling local controls…
Results
Review the settings and run. Editing inputs clears old results.
Processing model and limits
Analyze B-tree leftmost equality prefixes, one range column, order prefix and covering columns. Equality columns may occur in any order within the prefix; index columns allow ASC/DESC (default ASC), with a fully reversed scan allowed. No costs, selectivity, expressions, partial indexes or database execution. At most 100 queries × 100 indexes, 20 index columns.
Data and model checked: PostgreSQL multicolumn indexes ↗Source tool controls ↗
How to use this tool
Load the example, confirm field units and processing rules, then run locally. Editing any input clears the old result. Copy or download the complete output explicitly.
When not to use it
Analyze B-tree leftmost equality prefixes, one range column, order prefix and covering columns. Equality columns may occur in any order within the prefix; index columns allow ASC/DESC (default ASC), with a fully reversed scan allowed. No costs, selectivity, expressions, partial indexes or database execution. At most 100 queries × 100 indexes, 20 index columns.