PlanLens

PlanLens turns a pasted Postgres EXPLAIN (ANALYZE, FORMAT JSON) plan into an interactive tree with per-node timing, ranked findings and copyable CREATE INDEX DDL. Hotspots are ranked by exclusive time, misestimation magnitude and sort/hash spills, and index suggestions derive from filters, sort keys and join conditions, each with a rationale and a check-with-EXPLAIN caveat. Parsing, analysis and share links run entirely client-side, so plans containing real data never leave the machine.

What's interesting about it

• Normalizes 50+ node types into a tree; exclusive time is derived by subtracting children's inclusive time.
• Quantifies row-estimate drift per node as a signed log ratio between planner estimate and actual rows.
• Generates CREATE INDEX DDL with equality-before-range-before-sort column order, partial and expression indexes, and prefix deduplication.
• Flags filtered Seq Scans, sort and hash spills, dead branches, nested-loop misestimates, and trigger or JIT time.