explain.depesz.com

PostgreSQL's explain analyze made readable

Result: DUen

Settings
# exclusive inclusive rows x rows loops node
1. 170.846 1,204.158 ↓ 6.2 227,812 1

Sort (cost=85,919.90..86,011.59 rows=36,676 width=20) (actual time=1,170.514..1,204.158 rows=227,812 loops=1)

  • Sort Key: ce1.start_time, ce1.last_event_seating_asked_at
  • Sort Method: quicksort Memory: 23942kB
2. 78.815 1,033.312 ↓ 6.2 227,812 1

Nested Loop Anti Join (cost=1.23..83,139.39 rows=36,676 width=20) (actual time=0.524..1,033.312 rows=227,812 loops=1)

  • Join Filter: (eslq1.event_id = ce1.id)
3. 56.975 954.497 ↓ 6.2 227,812 1

Nested Loop (cost=0.98..82,586.99 rows=36,676 width=20) (actual time=0.034..954.497 rows=227,812 loops=1)

  • Join Filter: (ce1.consecutive_unsuccessful_event_seating_lookup_count < c1.maximum_consecutive_unsuccessful_event_seating_lookup_count)
4. 0.932 6.086 ↑ 1.3 2,212 1

Nested Loop (cost=0.56..2,527.29 rows=2,870 width=8) (actual time=0.010..6.086 rows=2,212 loops=1)

5. 1.284 1.284 ↑ 1.0 430 1

Index Scan using cinema_pkey on cinema c1 (cost=0.28..567.64 rows=430 width=8) (actual time=0.005..1.284 rows=430 loops=1)

  • Filter: (data_aggregation_disabled_at IS NULL)
  • Rows Removed by Filter: 386
6. 3.870 3.870 ↓ 1.2 5 430

Index Scan using public_venue_cinema_id0_idx on venue v1 (cost=0.28..4.52 rows=4 width=8) (actual time=0.003..0.009 rows=5 loops=430)

  • Index Cond: (cinema_id = c1.id)
7. 891.436 891.436 ↑ 1.1 103 2,212

Index Scan using current_event_venue_id_idx on current_event ce1 (cost=0.42..26.46 rows=115 width=28) (actual time=0.042..0.403 rows=103 loops=2,212)

  • Index Cond: (venue_id = v1.id)
  • Filter: ((event_seating_updated_at IS NOT NULL) AND (unrecoverable_error IS NULL) AND (start_time > now()))
  • Rows Removed by Filter: 127
8. 0.000 0.000 ↓ 0.0 0 227,812

Materialize (cost=0.25..2.27 rows=1 width=4) (actual time=0.000..0.000 rows=0 loops=227,812)

9. 0.488 0.488 ↓ 0.0 0 1

Index Only Scan using event_seating_lookup_queue_event_id_idx on event_seating_lookup_queue eslq1 (cost=0.25..2.27 rows=1 width=4) (actual time=0.488..0.488 rows=0 loops=1)

  • Heap Fetches: 1655
Planning time : 0.930 ms
Execution time : 1,217.766 ms