explain.depesz.com

PostgreSQL's explain analyze made readable

Result: aLoS

Settings
# exclusive inclusive rows x rows loops node
1. 0.004 1.632 ↑ 4.0 2 1

Sort (cost=708,591.67..708,591.69 rows=8 width=18) (actual time=1.632..1.632 rows=2 loops=1)

  • Sort Key: (count(0))
  • Sort Method: quicksort Memory: 25kB
2. 0.055 1.628 ↑ 4.0 2 1

HashAggregate (cost=708,591.47..708,591.55 rows=8 width=18) (actual time=1.627..1.628 rows=2 loops=1)

  • Group Key: events.operation
3. 0.308 1.573 ↑ 587,413.9 241 1

Nested Loop (cost=274.46..757.74 rows=141,566,747 width=10) (actual time=0.764..1.573 rows=241 loops=1)

4. 0.115 0.781 ↓ 1.2 242 1

HashAggregate (cost=273.87..275.85 rows=198 width=25) (actual time=0.743..0.781 rows=242 loops=1)

  • Group Key: (((que_jobs.args -> 0) ->> 'event_id'::text))::integer
5. 0.666 0.666 ↑ 1.6 242 1

Index Only Scan using idx_que_jobs_p_key on que_jobs (cost=0.27..272.89 rows=394 width=25) (actual time=0.262..0.666 rows=242 loops=1)

  • Filter: (error_count > 0)
  • Rows Removed by Filter: 168
  • Heap Fetches: 331
6. 0.484 0.484 ↑ 1.0 1 242

Index Scan using events_pkey on events (cost=0.58..2.80 rows=1 width=14) (actual time=0.002..0.002 rows=1 loops=242)

  • Index Cond: (id = (((que_jobs.args -> 0) ->> 'event_id'::text))::integer)
Planning time : 0.396 ms
Execution time : 1.684 ms