explain.depesz.com

PostgreSQL's explain analyze made readable

Result: 4oEz

Settings
# exclusive inclusive rows x rows loops node
1. 7.893 100.807 ↓ 491.0 1,473 1

Sort (cost=11,143.13..11,143.13 rows=3 width=3,129) (actual time=100.262..100.807 rows=1,473 loops=1)

  • Sort Key: cycles.end_year
  • Sort Method: quicksort Memory: 4135kB
2. 0.775 92.914 ↓ 491.0 1,473 1

Nested Loop (cost=64.88..11,143.10 rows=3 width=3,129) (actual time=1.251..92.914 rows=1,473 loops=1)

3. 2.984 86.247 ↓ 736.5 1,473 1

Nested Loop (cost=64.46..11,142.17 rows=2 width=3,102) (actual time=1.247..86.247 rows=1,473 loops=1)

  • Join Filter: ((cycles.license_id = nodes_3.id) AND (((cycles.workflow)::text <> 'cycle-light'::text) OR ((nodes_3.name
  • Rows Removed by Join Filter: 3465
4. 3.420 83.263 ↓ 1,234.5 2,469 1

Nested Loop (cost=60.64..11,136.75 rows=2 width=3,102) (actual time=0.834..83.263 rows=2,469 loops=1)

  • Join Filter: (contents.id = nodes.id)
5. 1.574 72.436 ↓ 493.8 2,469 1

Nested Loop (cost=60.22..11,133.11 rows=5 width=2,278) (actual time=0.821..72.436 rows=2,469 loops=1)

  • Join Filter: (communities.id = contents.id)
6. 23.253 60.986 ↓ 52.5 2,469 1

Hash Join (cost=59.79..11,110.17 rows=47 width=2,068) (actual time=0.808..60.986 rows=2,469 loops=1)

  • Hash Cond: (nodes_2.parent_id = communities.id)
  • -> Nested Loop (cost=1.70..11046.77 rows=1288 width=2029) (actual time=0.081..58.434 rows=2469 loo
  • -> Nested Loop (cost=1.27..10112.36 rows=1288 width=2025) (actual time=0.071..47.311 rows=24
  • -> Nested Loop (cost=0.84..8912.91 rows=1288 width=1201) (actual time=0.053..31.028 ro
  • -> Nested Loop (cost=0.42..8227.13 rows=1288 width=991) (actual time=0.040..16.3
  • -> Seq Scan on cycles (cost=0.00..155.53 rows=1288 width=960) (actual time
  • Filter: (((status)::text = 'archive'::text) AND ((level)::text = ANY (
  • Rows Removed by Filter: 2308
  • -> Index Scan using eea_contents_pkey on eea_contents eea_contents_1 (cost
  • Index Cond: (id = cycles.id)
7. 12.345 12.345 ↑ 1.0 1 2,469

Index Scan using contents_pkey on contents contents_1 (cost=0.42..0.52 rows=1 width=210) (actual time=0.005..0.005 rows=1 loops=2,469)

  • Index Cond: (id = eea_contents_1.id)
8. 14.814 14.814 ↑ 1.0 1 2,469

Index Scan using nodes_pkey on nodes nodes_1 (cost=0.42..0.92 rows=1 width=824) (actual time=0.006..0.006 rows=1 loops=2,469)

  • Index Cond: (id = contents_1.id)
  • Filter: ((path)::text ~~ '/%%'::text)
9. 9.876 9.876 ↑ 1.0 1 2,469

Index Scan using nodes_pkey on nodes nodes_2 (cost=0.42..0.72 rows=1 width=8) (actual time=0.004..0.004 rows=1 loops=2,469)

  • Index Cond: (id = nodes_1.parent_id)
10. 0.435 0.698 ↑ 1.0 1,871 1

Hash (cost=34.71..34.71 rows=1,871 width=39) (actual time=0.698..0.698 rows=1,871 loops=1)

  • Buckets: 2048 Batches: 1 Memory Usage: 140kB
11. 0.263 0.263 ↑ 1.0 1,871 1

Seq Scan on communities (cost=0.00..34.71 rows=1,871 width=39) (actual time=0.008..0.263 rows=1,871 loops=1)

12. 9.876 9.876 ↑ 1.0 1 2,469

Index Scan using contents_pkey on contents (cost=0.42..0.48 rows=1 width=210) (actual time=0.003..0.004 rows=1 loops=2,469)

  • Index Cond: (id = nodes_2.parent_id)
13. 7.407 7.407 ↑ 1.0 1 2,469

Index Scan using nodes_pkey on nodes (cost=0.42..0.72 rows=1 width=824) (actual time=0.003..0.003 rows=1 loops=2,469)

  • Index Cond: (id = nodes_2.parent_id)
14. 0.000 0.000 ↑ 1.0 2 2,469

Materialize (cost=3.82..5.34 rows=2 width=26) (actual time=0.000..0.000 rows=2 loops=2,469)

15. 0.005 0.252 ↑ 1.0 2 1

Nested Loop (cost=3.82..5.33 rows=2 width=26) (actual time=0.237..0.252 rows=2 loops=1)

16. 0.003 0.237 ↓ 2.0 2 1

Nested Loop (cost=3.40..4.86 rows=1 width=22) (actual time=0.227..0.237 rows=2 loops=1)

17. 0.020 0.224 ↑ 1.0 2 1

Merge Join (cost=2.97..3.00 rows=2 width=8) (actual time=0.220..0.224 rows=2 loops=1)

  • Merge Cond: (contents_2.id = licenses.id)
18. 0.180 0.180 ↑ 2,621.1 200 1

Index Only Scan using contents_pkey on contents contents_2 (cost=0.42..30,584.93 rows=524,221 width=4) (actual time=0.022..0.180 rows=200 loops=1)

  • Heap Fetches: 200
19. 0.019 0.024 ↑ 1.0 2 1

Sort (cost=1.03..1.03 rows=2 width=4) (actual time=0.024..0.024 rows=2 loops=1)

  • Sort Key: licenses.id
  • Sort Method: quicksort Memory: 25kB
20. 0.005 0.005 ↑ 1.0 2 1

Seq Scan on licenses (cost=0.00..1.02 rows=2 width=4) (actual time=0.005..0.005 rows=2 loops=1)

21. 0.010 0.010 ↑ 1.0 1 2

Index Scan using nodes_pkey on nodes nodes_3 (cost=0.42..0.92 rows=1 width=14) (actual time=0.005..0.005 rows=1 loops=2)

  • Index Cond: (id = contents_2.id)
22. 0.010 0.010 ↑ 1.0 1 2

Index Only Scan using eea_contents_pkey on eea_contents eea_contents_2 (cost=0.42..0.46 rows=1 width=4) (actual time=0.004..0.005 rows=1 loops=2)

  • Index Cond: (id = nodes_3.id)
  • Heap Fetches: 2
23. 5.892 5.892 ↑ 1.0 1 1,473

Index Scan using eea_contents_pkey on eea_contents (cost=0.42..0.46 rows=1 width=31) (actual time=0.004..0.004 rows=1 loops=1,473)

  • Index Cond: (id = nodes.id)