explain.depesz.com

PostgreSQL's explain analyze made readable

Result: omQ

Settings
# exclusive inclusive rows x rows loops node
1. 0.003 1,374.256 ↑ 1.0 10 1

Limit (cost=8,696.54..8,696.56 rows=10 width=665) (actual time=1,374.253..1,374.256 rows=10 loops=1)

2. 2.586 1,374.253 ↑ 72.9 10 1

Sort (cost=8,696.54..8,698.36 rows=729 width=665) (actual time=1,374.252..1,374.253 rows=10 loops=1)

  • Sort Key: notices.publish_at DESC
  • Sort Method: top-N heapsort Memory: 35kB
3. 2.191 1,371.667 ↓ 2.1 1,531 1

Nested Loop (cost=1.00..8,680.78 rows=729 width=665) (actual time=4.986..1,371.667 rows=1,531 loops=1)

4. 121.711 121.711 ↓ 2.0 1,531 1

Index Only Scan using uniq_security_notices_counter_id_notice_id on security_notices (cost=0.56..2,349.71 rows=754 width=8) (actual time=2.986..121.711 rows=1,531 loops=1)

  • Index Cond: (counter_id = 'ST/US/CAL'::text)
  • Heap Fetches: 1,531
5. 1,247.765 1,247.765 ↑ 1.0 1 1,531

Index Scan using notices_pkey on notices (cost=0.43..8.40 rows=1 width=665) (actual time=0.815..0.815 rows=1 loops=1,531)

  • Index Cond: (id = security_notices.notice_id)
  • Filter: (status = 2)
Planning time : 0.236 ms
Execution time : 1,374.287 ms