explain.depesz.com

PostgreSQL's explain analyze made readable

Result: XdpF

Settings
# exclusive inclusive rows x rows loops node
1. 0.316 1,303.502 ↓ 0.0 0 1

Insert on catmaid_skeleton_summary (cost=475,148.61..475,482.32 rows=4,045 width=60) (actual time=1,303.502..1,303.502 rows=0 loops=1)

  • Conflict Resolution: UPDATE
  • Conflict Arbiter Indexes: catmaid_skeleton_id_pkey
  • Tuples Inserted: 1
  • Conflicting Tuples: 3
  • Buffers: shared hit=536384
  • JIT:
  • Functions: 221
  • Options: Inlining false, Optimization false, Expressions true, Deforming true
  • Timing: Generation 26.760 ms, Inlining 0.000 ms, Optimization 6.764 ms, Emission 155.967 ms, Total 189.491 ms
2.          

CTE updated_edge_data

3. 3.557 877.503 ↑ 2.4 22,581 1

Append (cost=16,091.34..52,472.15 rows=53,159 width=108) (actual time=412.340..877.503 rows=22,581 loops=1)

  • Buffers: shared hit=423364
4. 311.905 732.115 ↑ 1.1 22,441 1

Merge Join (cost=16,091.34..27,432.66 rows=25,178 width=108) (actual time=412.339..732.115 rows=22,441 loops=1)

  • Merge Cond: (new_treenode_4.id = ot.id)
  • Join Filter: ((ot.parent_id IS DISTINCT FROM new_treenode_4.parent_id) OR (ot.location_x <> new_treenode_4.location_x) OR (ot.location_y <> new_treenode_4.location_y) OR (ot.location_z <> new_treenode_4.location_z) OR (ot.skeleton_id <> new_treenode_4.skeleton_id))
  • Buffers: shared hit=245376
5. 13.003 399.386 ↓ 10.0 22,441 1

Sort (cost=14,361.89..14,367.50 rows=2,244 width=72) (actual time=396.255..399.386 rows=22,441 loops=1)

  • Sort Key: new_treenode_4.id
  • Sort Method: quicksort Memory: 3924kB
  • Buffers: shared hit=245376
6. 28.498 386.383 ↓ 10.0 22,441 1

Nested Loop (cost=1,405.92..14,236.99 rows=2,244 width=72) (actual time=169.070..386.383 rows=22,441 loops=1)

  • Buffers: shared hit=245376
7. 167.693 178.357 ↓ 10.0 22,441 1

Limit (cost=1,402.59..1,537.23 rows=2,244 width=78) (actual time=169.000..178.357 rows=22,441 loops=1)

8.          

Initplan (for Limit)

9. 1.132 3.922 ↑ 1.0 1 1

Aggregate (cost=1,402.56..1,402.59 rows=1 width=8) (actual time=3.922..3.922 rows=1 loops=1)

10. 2.790 2.790 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=0) (actual time=0.015..2.790 rows=22,441 loops=1)

11. 6.742 6.742 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.002..6.742 rows=22,441 loops=1)

12. 67.323 179.528 ↑ 1.0 1 22,441

Bitmap Heap Scan on treenode p (cost=3.33..5.60 rows=1 width=20) (actual time=0.008..0.008 rows=1 loops=22,441)

  • Recheck Cond: ((id = new_treenode_4.parent_id) OR (id = new_treenode_4.id))
  • Filter: (((new_treenode_4.parent_id IS NOT NULL) AND (id = new_treenode_4.parent_id)) OR ((new_treenode_4.parent_id IS NULL) AND (id = new_treenode_4.id)))
  • Rows Removed by Filter: 1
  • Heap Blocks: exact=23457
  • Buffers: shared hit=245376
13. 0.000 112.205 ↓ 0.0 0 22,441

BitmapOr (cost=3.33..3.33 rows=2 width=0) (actual time=0.005..0.005 rows=0 loops=22,441)

  • Buffers: shared hit=179524
14. 67.323 67.323 ↓ 2.0 2 22,441

Bitmap Index Scan on treenode_id_pkey (cost=0.00..1.66 rows=1 width=0) (actual time=0.003..0.003 rows=2 loops=22,441)

  • Index Cond: (id = new_treenode_4.parent_id)
  • Buffers: shared hit=89760
15. 44.882 44.882 ↓ 2.0 2 22,441

Bitmap Index Scan on treenode_id_pkey (cost=0.00..1.66 rows=1 width=0) (actual time=0.002..0.002 rows=2 loops=22,441)

  • Index Cond: (id = new_treenode_4.id)
  • Buffers: shared hit=89764
16. 9.547 20.824 ↓ 10.0 22,441 1

Sort (cost=1,729.45..1,735.06 rows=2,244 width=52) (actual time=15.946..20.824 rows=22,441 loops=1)

  • Sort Key: ot.id
  • Sort Method: quicksort Memory: 3924kB
17. 2.581 11.277 ↓ 10.0 22,441 1

Subquery Scan on ot (cost=1,402.59..1,604.55 rows=2,244 width=52) (actual time=3.551..11.277 rows=22,441 loops=1)

18. 1.728 8.696 ↓ 10.0 22,441 1

Limit (cost=1,402.59..1,537.23 rows=2,244 width=78) (actual time=3.550..8.696 rows=22,441 loops=1)

19.          

Initplan (for Limit)

20. 1.126 3.544 ↑ 1.0 1 1

Aggregate (cost=1,402.56..1,402.59 rows=1 width=8) (actual time=3.544..3.544 rows=1 loops=1)

21. 2.418 2.418 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=0) (actual time=0.001..2.418 rows=22,441 loops=1)

22. 3.424 3.424 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.002..3.424 rows=22,441 loops=1)

23. 4.143 141.831 ↑ 199.9 140 1

Hash Join (cost=11,174.58..22,647.34 rows=27,981 width=108) (actual time=132.856..141.831 rows=140 loops=1)

  • Hash Cond: (old_treenode_3.id = c.parent_id)
  • Buffers: shared hit=177988
24. 1.922 10.426 ↓ 10.0 22,441 1

Limit (cost=1,402.59..1,537.23 rows=2,244 width=78) (actual time=5.028..10.426 rows=22,441 loops=1)

25.          

Initplan (for Limit)

26. 1.192 4.985 ↑ 1.0 1 1

Aggregate (cost=1,402.56..1,402.59 rows=1 width=8) (actual time=4.985..4.985 rows=1 loops=1)

27. 3.793 3.793 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=0) (actual time=0.007..3.793 rows=22,441 loops=1)

28. 3.519 3.519 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.003..3.519 rows=22,441 loops=1)

29. 0.087 127.262 ↑ 17.8 140 1

Hash (cost=9,690.93..9,690.93 rows=2,494 width=84) (actual time=127.262..127.262 rows=140 loops=1)

  • Buckets: 4096 Batches: 1 Memory Usage: 49kB
  • Buffers: shared hit=177988
30. 6.724 127.175 ↑ 17.8 140 1

Hash Anti Join (cost=3,080.64..9,690.93 rows=2,494 width=84) (actual time=23.014..127.175 rows=140 loops=1)

  • Hash Cond: (c.id = c2.id)
  • Buffers: shared hit=177988
31. 6.759 107.558 ↓ 9.0 22,501 1

Nested Loop (cost=1,403.16..7,932.08 rows=2,494 width=84) (actual time=3.808..107.558 rows=22,501 loops=1)

  • Buffers: shared hit=177988
32. 2.194 11.035 ↓ 10.0 22,441 1

Limit (cost=1,402.59..1,537.23 rows=2,244 width=78) (actual time=3.764..11.035 rows=22,441 loops=1)

33.          

Initplan (for Limit)

34. 1.194 3.749 ↑ 1.0 1 1

Aggregate (cost=1,402.56..1,402.59 rows=1 width=8) (actual time=3.749..3.749 rows=1 loops=1)

35. 2.555 2.555 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=0) (actual time=0.003..2.555 rows=22,441 loops=1)

36. 5.092 5.092 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.004..5.092 rows=22,441 loops=1)

37. 89.764 89.764 ↑ 1.0 1 22,441

Index Scan using treenode_parent_id_idx on treenode c (cost=0.56..2.79 rows=1 width=60) (actual time=0.003..0.004 rows=1 loops=22,441)

  • Index Cond: (parent_id = new_treenode_5.id)
  • Buffers: shared hit=177988
38. 3.233 12.893 ↓ 10.0 22,441 1

Hash (cost=1,604.55..1,604.55 rows=2,244 width=8) (actual time=12.892..12.893 rows=22,441 loops=1)

  • Buckets: 32768 (originally 4096) Batches: 1 (originally 1) Memory Usage: 1133kB
39. 2.416 9.660 ↓ 10.0 22,441 1

Subquery Scan on c2 (cost=1,402.59..1,604.55 rows=2,244 width=8) (actual time=2.729..9.660 rows=22,441 loops=1)

40. 1.799 7.244 ↓ 10.0 22,441 1

Limit (cost=1,402.59..1,537.23 rows=2,244 width=78) (actual time=2.726..7.244 rows=22,441 loops=1)

41.          

Initplan (for Limit)

42. 1.170 2.718 ↑ 1.0 1 1

Aggregate (cost=1,402.56..1,402.59 rows=1 width=8) (actual time=2.717..2.718 rows=1 loops=1)

43. 1.548 1.548 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=0) (actual time=0.002..1.548 rows=22,441 loops=1)

44. 2.727 2.727 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.004..2.727 rows=22,441 loops=1)

45.          

CTE old_edge

46. 35.881 1,121.721 ↑ 2.4 22,581 1

Nested Loop (cost=0.56..138,588.14 rows=53,159 width=104) (actual time=412.386..1,121.721 rows=22,581 loops=1)

  • Buffers: shared hit=536269
47. 927.773 927.773 ↑ 2.4 22,581 1

CTE Scan on updated_edge_data t (cost=0.00..3,189.54 rows=53,159 width=40) (actual time=412.342..927.773 rows=22,581 loops=1)

  • Buffers: shared hit=423364
48. 158.067 158.067 ↑ 1.0 1 22,581

Index Scan using treenode_edge_pkey on treenode_edge e (cost=0.56..2.55 rows=1 width=72) (actual time=0.007..0.007 rows=1 loops=22,581)

  • Index Cond: (id = t.id)
  • Buffers: shared hit=112905
49.          

CTE updated_edge

50. 1,899.569 2,072.756 ↑ 2.4 22,581 1

Update on treenode_edge e_1 (cost=0.56..138,721.04 rows=53,159 width=130) (actual time=0.259..2,072.756 rows=22,581 loops=1)

  • Buffers: shared hit=641505 read=1426 dirtied=31274 written=369
51. 22.766 173.187 ↑ 2.4 22,581 1

Nested Loop (cost=0.56..138,721.04 rows=53,159 width=130) (actual time=0.046..173.187 rows=22,581 loops=1)

  • Buffers: shared hit=112905
52. 37.516 37.516 ↑ 2.4 22,581 1

CTE Scan on updated_edge_data ue_2 (cost=0.00..3,189.54 rows=53,159 width=120) (actual time=0.020..37.516 rows=22,581 loops=1)

53. 112.905 112.905 ↑ 1.0 1 22,581

Index Scan using treenode_edge_pkey on treenode_edge e_1 (cost=0.56..2.55 rows=1 width=18) (actual time=0.005..0.005 rows=1 loops=22,581)

  • Index Cond: (id = ue_2.id)
  • Buffers: shared hit=112905
54.          

CTE old_skeleton_data

55. 12.646 1,238.981 ↑ 1,772.0 3 1

HashAggregate (cost=12,279.20..12,465.26 rows=5,316 width=48) (actual time=1,238.930..1,238.981 rows=3 loops=1)

  • Group Key: old_edge.skeleton_id, old_edge.project_id, first_value(old_edge.editor_id) OVER (?)
  • Buffers: shared hit=536269
56. 52.372 1,226.335 ↑ 2.4 22,581 1

WindowAgg (cost=7,362.00..9,621.25 rows=53,159 width=64) (actual time=1,171.914..1,226.335 rows=22,581 loops=1)

  • Buffers: shared hit=536269
57. 24.160 1,173.963 ↑ 2.4 22,581 1

Sort (cost=7,362.00..7,494.89 rows=53,159 width=64) (actual time=1,171.876..1,173.963 rows=22,581 loops=1)

  • Sort Key: old_edge.skeleton_id, old_edge.project_id, old_edge.edition_time DESC
  • Sort Method: quicksort Memory: 3944kB
  • Buffers: shared hit=536269
58. 1,149.803 1,149.803 ↑ 2.4 22,581 1

CTE Scan on old_edge (cost=0.00..3,189.54 rows=53,159 width=64) (actual time=412.391..1,149.803 rows=22,581 loops=1)

  • Buffers: shared hit=536269
59.          

CTE imported_nodes

60. 0.002 0.066 ↓ 0.0 0 1

Nested Loop (cost=1,417.51..1,758.74 rows=1 width=16) (actual time=0.066..0.066 rows=0 loops=1)

  • Buffers: shared hit=3
61. 0.002 0.064 ↓ 0.0 0 1

Nested Loop (cost=1,416.95..1,755.93 rows=1 width=32) (actual time=0.064..0.064 rows=0 loops=1)

  • Buffers: shared hit=3
62. 0.008 0.062 ↓ 0.0 0 1

Hash Join (cost=1,407.00..1,745.92 rows=1 width=16) (actual time=0.062..0.062 rows=0 loops=1)

  • Hash Cond: (osd.skeleton_id = css.skeleton_id)
  • Buffers: shared hit=3
63. 0.001 0.001 ↑ 5,316.0 1 1

CTE Scan on old_skeleton_data osd (cost=0.00..318.96 rows=5,316 width=8) (actual time=0.001..0.001 rows=1 loops=1)

64. 0.001 0.053 ↓ 0.0 0 1

Hash (cost=1,406.97..1,406.97 rows=1 width=24) (actual time=0.053..0.053 rows=0 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
65. 0.008 0.052 ↓ 0.0 0 1

Hash Join (cost=1.60..1,406.97 rows=1 width=24) (actual time=0.052..0.052 rows=0 loops=1)

  • Hash Cond: (t_1.skeleton_id = css.skeleton_id)
  • Buffers: shared hit=3
66. 0.010 0.010 ↑ 22,441.0 1 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=16) (actual time=0.010..0.010 rows=1 loops=1)

67. 0.001 0.034 ↓ 0.0 0 1

Hash (cost=1.57..1.57 rows=1 width=8) (actual time=0.034..0.034 rows=0 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
68. 0.033 0.033 ↓ 0.0 0 1

Index Scan using catmaid_skeleton_summary_num_imported_nodes_idx on catmaid_skeleton_summary css (cost=0.43..1.57 rows=1 width=8) (actual time=0.033..0.033 rows=0 loops=1)

  • Index Cond: (num_imported_nodes > 0)
  • Buffers: shared hit=3
69. 0.000 0.000 ↓ 0.0 0

Limit (cost=9.95..9.95 rows=1 width=16) (never executed)

70. 0.000 0.000 ↓ 0.0 0

Sort (cost=9.95..9.97 rows=10 width=16) (never executed)

  • Sort Key: treenode.edition_time
71. 0.000 0.000 ↓ 0.0 0

Append (cost=0.56..9.90 rows=10 width=16) (never executed)

72. 0.000 0.000 ↓ 0.0 0

Index Scan using treenode_id_pkey on treenode (cost=0.56..2.80 rows=1 width=16) (never executed)

  • Index Cond: (id = t_1.id)
73. 0.000 0.000 ↓ 0.0 0

Index Scan using treenode__history_live_pk_index on treenode__history (cost=0.56..6.95 rows=9 width=16) (never executed)

  • Index Cond: (id = t_1.id)
74. 0.000 0.000 ↓ 0.0 0

Index Scan using catmaid_transaction_info_pk on catmaid_transaction_info cti (cost=0.56..2.81 rows=1 width=16) (never executed)

  • Index Cond: ((transaction_id = treenode.txid) AND (execution_time = treenode.edition_time))
  • Filter: (label = 'skeletons.import'::text)
75. 0.027 1,303.186 ↑ 1,011.2 4 1

Subquery Scan on s (cost=131,143.28..131,476.99 rows=4,045 width=60) (actual time=1,303.123..1,303.186 rows=4 loops=1)

  • Buffers: shared hit=536272
76. 0.090 1,303.159 ↑ 1,011.2 4 1

HashAggregate (cost=131,143.28..131,284.85 rows=4,045 width=104) (actual time=1,303.101..1,303.159 rows=4 loops=1)

  • Group Key: os.skeleton_id, os.project_id, first_value(os.last_editor_id) OVER (?)
  • Buffers: shared hit=536272
77. 0.039 1,303.069 ↑ 5,779.1 7 1

WindowAgg (cost=127,401.28..129,120.58 rows=40,454 width=56) (actual time=1,303.060..1,303.069 rows=7 loops=1)

  • Buffers: shared hit=536272
78. 0.029 1,303.030 ↑ 5,779.1 7 1

Sort (cost=127,401.28..127,502.42 rows=40,454 width=56) (actual time=1,303.030..1,303.030 rows=7 loops=1)

  • Sort Key: os.skeleton_id, os.project_id, os.max_edition_time DESC
  • Sort Method: quicksort Memory: 25kB
  • Buffers: shared hit=536272
79. 0.011 1,303.001 ↑ 5,779.1 7 1

Result (cost=0.16..124,305.74 rows=40,454 width=56) (actual time=1,239.056..1,303.001 rows=7 loops=1)

  • Buffers: shared hit=536272
80. 0.006 1,302.990 ↑ 5,779.1 7 1

Append (cost=0.16..123,092.12 rows=40,454 width=56) (actual time=1,239.049..1,302.990 rows=7 loops=1)

  • Buffers: shared hit=536272
81. 0.039 1,239.100 ↑ 1,772.0 3 1

Hash Left Join (cost=0.16..347.20 rows=5,316 width=56) (actual time=1,239.046..1,239.100 rows=3 loops=1)

  • Hash Cond: (os.skeleton_id = ins.skeleton_id)
  • Buffers: shared hit=536272
82. 1,238.988 1,238.988 ↑ 1,772.0 3 1

CTE Scan on old_skeleton_data os (cost=0.00..318.96 rows=5,316 width=48) (actual time=1,238.935..1,238.988 rows=3 loops=1)

  • Buffers: shared hit=536269
83. 0.001 0.073 ↓ 0.0 0 1

Hash (cost=0.12..0.12 rows=1 width=16) (actual time=0.073..0.073 rows=0 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
84. 0.002 0.072 ↓ 0.0 0 1

Subquery Scan on ins (cost=0.07..0.12 rows=1 width=16) (actual time=0.072..0.072 rows=0 loops=1)

  • Buffers: shared hit=3
85. 0.002 0.070 ↓ 0.0 0 1

HashAggregate (cost=0.07..0.10 rows=1 width=16) (actual time=0.070..0.070 rows=0 loops=1)

  • Group Key: ins_1.old_skeleton_id
  • Buffers: shared hit=3
86. 0.068 0.068 ↓ 0.0 0 1

CTE Scan on imported_nodes ins_1 (cost=0.00..0.06 rows=1 width=8) (actual time=0.068..0.068 rows=0 loops=1)

  • Buffers: shared hit=3
87. 0.026 63.884 ↑ 8,784.5 4 1

Hash Left Join (cost=118,718.50..120,924.49 rows=35,138 width=56) (actual time=62.494..63.884 rows=4 loops=1)

  • Hash Cond: (ue.skeleton_id = ins_2.skeleton_id)
88. 11.751 63.828 ↑ 8,784.5 4 1

HashAggregate (cost=117,269.42..118,323.56 rows=35,138 width=48) (actual time=62.440..63.828 rows=4 loops=1)

  • Group Key: ue.skeleton_id, ue.project_id, first_value(ue.editor_id) OVER (?)
89. 13.818 52.077 ↑ 15.6 22,581 1

WindowAgg (cost=84,766.67..99,700.37 rows=351,381 width=64) (actual time=37.097..52.077 rows=22,581 loops=1)

90. 7.818 38.259 ↑ 15.6 22,581 1

Sort (cost=84,766.67..85,645.13 rows=351,381 width=64) (actual time=37.055..38.259 rows=22,581 loops=1)

  • Sort Key: ue.skeleton_id, ue.project_id, ue.edition_time DESC
  • Sort Method: quicksort Memory: 3944kB
91. 2.312 30.441 ↑ 15.6 22,581 1

Result (cost=0.00..52,399.78 rows=351,381 width=64) (actual time=0.014..30.441 rows=22,581 loops=1)

92. 1.783 28.129 ↑ 15.6 22,581 1

Append (cost=0.00..41,858.35 rows=351,381 width=64) (actual time=0.006..28.129 rows=22,581 loops=1)

93. 7.494 7.494 ↑ 2.4 22,581 1

CTE Scan on updated_edge_data ue (cost=0.00..3,189.54 rows=53,159 width=64) (actual time=0.005..7.494 rows=22,581 loops=1)

94. 0.002 18.852 ↓ 0.0 0 1

Subquery Scan on *SELECT* 2 (cost=14,008.06..33,398.10 rows=298,222 width=64) (actual time=18.852..18.852 rows=0 loops=1)

95. 0.003 18.850 ↓ 0.0 0 1

Merge Join (cost=14,008.06..24,451.44 rows=298,222 width=72) (actual time=18.850..18.850 rows=0 loops=1)

  • Merge Cond: (new_treenode.id = oe.id)
96. 0.015 18.847 ↓ 0.0 0 1

Sort (cost=6,646.06..6,648.86 rows=1,122 width=40) (actual time=18.847..18.847 rows=0 loops=1)

  • Sort Key: new_treenode.id
  • Sort Method: quicksort Memory: 25kB
97. 3.261 18.832 ↓ 0.0 0 1

Hash Anti Join (cost=6,319.80..6,589.22 rows=1,122 width=40) (actual time=18.832..18.832 rows=0 loops=1)

  • Hash Cond: (new_treenode.id = ue_1.id)
98. 1.803 9.083 ↓ 10.0 22,441 1

Limit (cost=1,402.59..1,537.23 rows=2,244 width=78) (actual time=3.820..9.083 rows=22,441 loops=1)

99.          

Initplan (for Limit)

100. 1.122 3.795 ↑ 1.0 1 1

Aggregate (cost=1,402.56..1,402.59 rows=1 width=8) (actual time=3.795..3.795 rows=1 loops=1)

101. 2.673 2.673 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=0) (actual time=0.007..2.673 rows=22,441 loops=1)

102. 3.485 3.485 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.003..3.485 rows=22,441 loops=1)

103. 3.271 6.488 ↑ 2.4 22,581 1

Hash (cost=3,189.54..3,189.54 rows=53,159 width=8) (actual time=6.488..6.488 rows=22,581 loops=1)

  • Buckets: 65536 Batches: 1 Memory Usage: 1395kB
104. 3.217 3.217 ↑ 2.4 22,581 1

CTE Scan on updated_edge_data ue_1 (cost=0.00..3,189.54 rows=53,159 width=8) (actual time=0.004..3.217 rows=22,581 loops=1)

105. 0.000 0.000 ↓ 0.0 0

Sort (cost=7,362.00..7,494.89 rows=53,159 width=40) (never executed)

  • Sort Key: oe.id
106. 0.000 0.000 ↓ 0.0 0

CTE Scan on old_edge oe (cost=0.00..3,189.54 rows=53,159 width=40) (never executed)

107. 0.000 0.030 ↓ 0.0 0 1

Hash (cost=1,445.44..1,445.44 rows=112 width=16) (actual time=0.030..0.030 rows=0 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
108. 0.002 0.030 ↓ 0.0 0 1

Subquery Scan on ins_2 (cost=1,437.88..1,445.44 rows=112 width=16) (actual time=0.030..0.030 rows=0 loops=1)

109. 0.003 0.028 ↓ 0.0 0 1

GroupAggregate (cost=1,437.88..1,442.08 rows=112 width=16) (actual time=0.028..0.028 rows=0 loops=1)

  • Group Key: nt.skeleton_id
110. 0.007 0.025 ↓ 0.0 0 1

Sort (cost=1,437.88..1,438.16 rows=112 width=8) (actual time=0.025..0.025 rows=0 loops=1)

  • Sort Key: nt.skeleton_id
  • Sort Method: quicksort Memory: 25kB
111. 0.011 0.018 ↓ 0.0 0 1

Hash Join (cost=0.09..1,434.07 rows=112 width=8) (actual time=0.018..0.018 rows=0 loops=1)

  • Hash Cond: (nt.id = ins_3.id)
112. 0.005 0.005 ↑ 22,441.0 1 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=16) (actual time=0.005..0.005 rows=1 loops=1)

113. 0.001 0.002 ↓ 0.0 0 1

Hash (cost=0.06..0.06 rows=1 width=8) (actual time=0.002..0.002 rows=0 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
114. 0.001 0.001 ↓ 0.0 0 1

CTE Scan on imported_nodes ins_3 (cost=0.00..0.06 rows=1 width=8) (actual time=0.001..0.001 rows=0 loops=1)