explain.depesz.com

PostgreSQL's explain analyze made readable

Result: mnep

Settings
# exclusive inclusive rows x rows loops node
1. 0.008 26,279.434 ↓ 4.0 4 1

Nested Loop (cost=359,015.01..527,052.07 rows=1 width=24) (actual time=25,228.062..26,279.434 rows=4 loops=1)

  • Join Filter: (e.id <> e_3.id)
2.          

Initplan (for Nested Loop)

3. 0.014 0.014 ↑ 1.0 1 1

Result (cost=0.00..0.26 rows=1 width=8) (actual time=0.014..0.014 rows=1 loops=1)

4. 236.060 26,279.356 ↓ 4.0 4 1

Hash Join (cost=359,014.33..527,051.30 rows=1 width=16) (actual time=25,228.039..26,279.356 rows=4 loops=1)

  • Hash Cond: (e_2.id = pdm.matched_place_description_id)
5. 3,298.491 25,981.060 ↑ 1.0 3,048,155 1

Hash Join (cost=354,178.45..510,750.27 rows=3,057,364 width=16) (actual time=13,073.236..25,981.060 rows=3,048,155 loops=1)

  • Hash Cond: (cvp_2.place_description_id = e_2.id)
6. 8,810.916 17,758.659 ↑ 1.0 3,048,155 1

Hash Join (cost=232,571.06..345,130.29 rows=3,057,364 width=8) (actual time=8,147.337..17,758.659 rows=3,048,155 loops=1)

  • Hash Cond: (cvp_2.place_description_version_id = v_2.id)
7. 801.480 801.480 ↑ 1.0 3,048,155 1

Seq Scan on place_description_current_version_pointer cvp_2 (cost=0.00..56,091.64 rows=3,057,364 width=16) (actual time=0.011..801.480 rows=3,048,155 loops=1)

8. 7,065.196 8,146.263 ↓ 1.0 4,758,441 1

Hash (cost=154,520.36..154,520.36 rows=4,757,336 width=8) (actual time=8,146.262..8,146.263 rows=4,758,441 loops=1)

  • Buckets: 131072 Batches: 64 Memory Usage: 3933kB
9. 1,081.067 1,081.067 ↓ 1.0 4,758,441 1

Seq Scan on place_description_version v_2 (cost=0.00..154,520.36 rows=4,757,336 width=8) (actual time=0.006..1,081.067 rows=4,758,441 loops=1)

10. 4,315.813 4,923.910 ↑ 1.0 3,048,155 1

Hash (cost=70,785.06..70,785.06 rows=3,097,706 width=8) (actual time=4,923.910..4,923.910 rows=3,048,155 loops=1)

  • Buckets: 131072 Batches: 64 Memory Usage: 2889kB
11. 608.097 608.097 ↑ 1.0 3,048,155 1

Seq Scan on place_description e_2 (cost=0.00..70,785.06 rows=3,097,706 width=8) (actual time=0.011..608.097 rows=3,048,155 loops=1)

12. 0.011 62.236 ↓ 1.3 4 1

Hash (cost=4,835.85..4,835.85 rows=3 width=32) (actual time=62.236..62.236 rows=4 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
13. 33.696 62.225 ↓ 1.3 4 1

Hash Join (cost=30.26..4,835.85 rows=3 width=32) (actual time=47.029..62.225 rows=4 loops=1)

  • Hash Cond: (cvp_3.place_subscription_version_id = v_3.id)
14. 28.389 28.389 ↑ 1.0 217,568 1

Seq Scan on place_subscription_current_version_pointer cvp_3 (cost=0.00..3,989.68 rows=217,568 width=16) (actual time=0.006..28.389 rows=217,568 loops=1)

15. 0.005 0.140 ↓ 1.3 4 1

Hash (cost=30.22..30.22 rows=3 width=32) (actual time=0.140..0.140 rows=4 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
16. 0.007 0.135 ↓ 1.3 4 1

Nested Loop (cost=3.41..30.22 rows=3 width=32) (actual time=0.115..0.135 rows=4 loops=1)

17. 0.001 0.103 ↓ 2.5 5 1

Nested Loop (cost=2.99..29.32 rows=2 width=16) (actual time=0.099..0.103 rows=5 loops=1)

18. 0.001 0.086 ↑ 1.0 1 1

Nested Loop (cost=2.55..27.58 rows=1 width=24) (actual time=0.084..0.086 rows=1 loops=1)

19. 0.001 0.071 ↑ 1.0 1 1

Nested Loop (cost=2.12..26.96 rows=1 width=16) (actual time=0.070..0.071 rows=1 loops=1)

20. 0.000 0.060 ↑ 1.0 1 1

Nested Loop (cost=1.69..26.45 rows=1 width=32) (actual time=0.059..0.060 rows=1 loops=1)

21. 0.001 0.050 ↑ 1.0 1 1

Nested Loop (cost=1.26..25.32 rows=1 width=16) (actual time=0.048..0.050 rows=1 loops=1)

22. 0.002 0.039 ↑ 1.0 1 1

Nested Loop (cost=0.84..16.89 rows=1 width=16) (actual time=0.037..0.039 rows=1 loops=1)

23. 0.027 0.027 ↑ 1.0 1 1

Index Only Scan using place_subscription_pkey on place_subscription e (cost=0.42..8.44 rows=1 width=8) (actual time=0.027..0.027 rows=1 loops=1)

  • Index Cond: (id = $0)
  • Heap Fetches: 1
24. 0.010 0.010 ↑ 1.0 1 1

Index Scan using place_subscription_current_version_pointer_ux1 on place_subscription_current_version_pointer cvp (cost=0.42..8.44 rows=1 width=16) (actual time=0.010..0.010 rows=1 loops=1)

  • Index Cond: (place_subscription_id = $0)
25. 0.010 0.010 ↑ 1.0 1 1

Index Scan using place_subscription_version_pkey on place_subscription_version v (cost=0.42..8.44 rows=1 width=16) (actual time=0.010..0.010 rows=1 loops=1)

  • Index Cond: (id = cvp.place_subscription_version_id)
26. 0.010 0.010 ↑ 1.0 1 1

Index Scan using place_description_current_version_pointer_ux1 on place_description_current_version_pointer cvp_1 (cost=0.43..1.12 rows=1 width=16) (actual time=0.010..0.010 rows=1 loops=1)

  • Index Cond: (place_description_id = v.place_description_id)
27. 0.010 0.010 ↑ 1.0 1 1

Index Only Scan using place_description_pkey on place_description e_1 (cost=0.43..0.51 rows=1 width=8) (actual time=0.010..0.010 rows=1 loops=1)

  • Index Cond: (id = cvp_1.place_description_id)
  • Heap Fetches: 1
28. 0.014 0.014 ↑ 1.0 1 1

Index Only Scan using place_description_version_pkey on place_description_version v_1 (cost=0.43..0.62 rows=1 width=8) (actual time=0.014..0.014 rows=1 loops=1)

  • Index Cond: (id = cvp_1.place_description_version_id)
  • Heap Fetches: 1
29. 0.016 0.016 ↑ 8.8 5 1

Index Only Scan using place_description_match_ux1 on place_description_match pdm (cost=0.43..1.31 rows=44 width=16) (actual time=0.014..0.016 rows=5 loops=1)

  • Index Cond: (place_description_version_id = v_1.id)
  • Heap Fetches: 5
30. 0.025 0.025 ↑ 1.0 1 5

Index Scan using place_subscription_version_ix1 on place_subscription_version v_3 (cost=0.42..0.44 rows=1 width=16) (actual time=0.005..0.005 rows=1 loops=5)

  • Index Cond: (place_description_id = pdm.matched_place_description_id)
31. 0.056 0.056 ↑ 1.0 1 4

Index Scan using place_subscription_pkey on place_subscription e_3 (cost=0.42..0.50 rows=1 width=24) (actual time=0.014..0.014 rows=1 loops=4)

  • Index Cond: (id = cvp_3.place_subscription_id)
Planning time : 7.171 ms
Execution time : 26,280.416 ms