explain.depesz.com

PostgreSQL's explain analyze made readable

Result: tkpN

Settings
# exclusive inclusive rows x rows loops node
1. 55.336 418.680 ↑ 1.0 10,388 1

Nested Loop Left Join (cost=173.48..1,890,684.08 rows=10,388 width=63) (actual time=0.053..418.680 rows=10,388 loops=1)

  • Output: j.upc, product.created, product.provider, (SubPlan 1)
2. 10.152 10.152 ↑ 1.0 10,388 1

Seq Scan on public."JobPayload" j (cost=0.00..515.90 rows=10,388 width=12) (actual time=0.011..10.152 rows=10,388 loops=1)

  • Output: j.job_id, j.upc
  • Filter: (j.job_id = 66)
  • Rows Removed by Filter: 4
3. 51.940 280.476 ↑ 1.0 1 10,388

Limit (cost=173.48..173.48 rows=1 width=27) (actual time=0.023..0.027 rows=1 loops=10,388)

  • Output: product.id, product.created, product.provider
4. 51.940 228.536 ↑ 42.0 1 10,388

Sort (cost=173.48..173.59 rows=42 width=27) (actual time=0.022..0.022 rows=1 loops=10,388)

  • Output: product.id, product.created, product.provider
  • Sort Key: product.created DESC
  • Sort Method: top-N heapsort Memory: 25kB
5. 176.596 176.596 ↑ 10.5 4 10,388

Index Scan using product_upc_idx on public."Product" product (cost=0.56..173.27 rows=42 width=27) (actual time=0.009..0.017 rows=4 loops=10,388)

  • Output: product.id, product.created, product.provider
  • Index Cond: ((product.upc)::text = (j.upc)::text)
6.          

SubPlan (for Nested Loop Left Join)

7. 72.716 72.716 ↑ 1.0 1 10,388

Index Scan using "ProductPayload_pkey" on public."ProductPayload" (cost=0.43..8.45 rows=1 width=230) (actual time=0.006..0.007 rows=1 loops=10,388)

  • Output: "ProductPayload".payload
  • Index Cond: ("ProductPayload".pid = product.id)
Planning time : 0.263 ms
Execution time : 426.929 ms