SQL Query Optimizer

Analyze the following [DATABASE_TYPE, e.g., PostgreSQL, MySQL] query for performance bottlenecks:

[PASTE YOUR SQL QUERY]

The query runs on a table with approximately ⟨TABLE_SIZE⟩ rows. Current execution time: [TIME, if known] EXPLAIN output: [PASTE EXPLAIN OUTPUT IF AVAILABLE]

Please:

1. Identify Inefficiencies: Full table scans, missing indexes, cartesian joins, N+1 patterns, unnecessary subqueries
2. Rewrite the Query: Provide an optimized version with:
   • Suggested indexes (CREATE INDEX statements)
   • Query restructuring (CTEs, window functions, JOINs instead of subqueries)
   • Pagination strategy if returning large result sets
3. Estimate Improvement: Before/after complexity analysis
4. Edge Cases: What happens when the table grows 10x? Will the query still perform?