explain.depesz.com

PostgreSQL's explain analyze made readable

Result: nWdF

Settings
# exclusive inclusive rows x rows loops node
1. 0.379 3,208.844 ↓ 0.0 0 1

Insert on catmaid_skeleton_summary (cost=18,964,482.06..18,980,466.35 rows=193,749 width=60) (actual time=3,208.844..3,208.844 rows=0 loops=1)

  • Conflict Resolution: UPDATE
  • Conflict Arbiter Indexes: catmaid_skeleton_id_pkey
  • Tuples Inserted: 1
  • Conflicting Tuples: 3
  • Buffers: shared hit=447523 dirtied=11544
  • JIT:
  • Functions: 219
  • Options: Inlining true, Optimization true, Expressions true, Deforming true
  • Timing: Generation 32.702 ms, Inlining 32.780 ms, Optimization 1429.780 ms, Emission 1012.341 ms, Total 2507.603 ms
2.          

CTE old_new

3. 22.244 2,517.853 ↑ 112.2 22,441 1

Merge Join (cost=5,936.51..125,653.33 rows=2,517,992 width=114) (actual time=2,490.248..2,517.853 rows=22,441 loops=1)

  • Merge Cond: (ot.id = t.id)
  • Join Filter: ((ot.parent_id IS DISTINCT FROM t.parent_id) OR (ot.location_x <> t.location_x) OR (ot.location_y <> t.location_y) OR (ot.location_z <> t.location_z) OR (ot.skeleton_id <> t.skeleton_id))
4. 6.741 2,488.364 ↑ 1.0 22,441 1

Sort (cost=2,968.25..3,024.36 rows=22,441 width=52) (actual time=2,486.145..2,488.364 rows=22,441 loops=1)

  • Sort Key: ot.id
  • Sort Method: quicksort Memory: 3924kB
5. 2,481.623 2,481.623 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=52) (actual time=2,478.642..2,481.623 rows=22,441 loops=1)

6. 5.900 7.245 ↑ 1.0 22,441 1

Sort (cost=2,968.25..3,024.36 rows=22,441 width=78) (actual time=4.069..7.245 rows=22,441 loops=1)

  • Sort Key: t.id
  • Sort Method: quicksort Memory: 3924kB
7. 1.345 1.345 ↑ 1.0 22,441 1

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

8.          

CTE updated_edge_data

9. 4.008 2,841.841 ↑ 112.7 22,581 1

Append (cost=0.56..3,472,192.78 rows=2,545,974 width=108) (actual time=2,490.385..2,841.841 rows=22,581 loops=1)

  • Buffers: shared hit=334501
10. 75.813 2,701.411 ↑ 111.6 22,440 1

Nested Loop (cost=0.56..3,149,407.28 rows=2,505,402 width=108) (actual time=2,490.382..2,701.411 rows=22,440 loops=1)

  • Buffers: shared hit=134561
11. 2,535.838 2,535.838 ↑ 111.6 22,440 1

CTE Scan on old_new ton (cost=0.00..151,079.52 rows=2,505,402 width=96) (actual time=2,490.256..2,535.838 rows=22,440 loops=1)

  • Filter: (parent_id IS NOT NULL)
  • Rows Removed by Filter: 1
12. 89.760 89.760 ↑ 1.0 1 22,440

Index Scan using treenode_id_pkey on treenode p (cost=0.56..0.92 rows=1 width=20) (actual time=0.004..0.004 rows=1 loops=22,440)

  • Index Cond: (id = ton.parent_id)
  • Buffers: shared hit=134561
13. 0.050 2.340 ↑ 12,590.0 1 1

Nested Loop (cost=0.56..189,136.65 rows=12,590 width=108) (actual time=1.974..2.340 rows=1 loops=1)

  • Buffers: shared hit=6
14. 2.273 2.273 ↑ 12,590.0 1 1

CTE Scan on old_new ton_1 (cost=0.00..151,079.52 rows=12,590 width=96) (actual time=1.908..2.273 rows=1 loops=1)

  • Filter: (parent_id IS NULL)
  • Rows Removed by Filter: 22440
15. 0.017 0.017 ↑ 1.0 1 1

Index Scan using treenode_id_pkey on treenode p_1 (cost=0.56..2.75 rows=1 width=20) (actual time=0.017..0.017 rows=1 loops=1)

  • Index Cond: (id = ton_1.id)
  • Buffers: shared hit=6
16. 2.506 134.082 ↑ 199.9 140 1

Hash Join (cost=11,174.58..19,080.03 rows=27,982 width=108) (actual time=127.439..134.082 rows=140 loops=1)

  • Hash Cond: (old_treenode_1.id = c.parent_id)
  • Buffers: shared hit=199934
17. 1.800 8.291 ↓ 10.0 22,441 1

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

18.          

Initplan (for Limit)

19. 1.038 3.689 ↑ 1.0 1 1

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

20. 2.651 2.651 ↑ 1.0 22,441 1

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

21. 2.802 2.802 ↑ 1.0 22,441 1

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

22. 0.084 123.285 ↑ 17.8 140 1

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

  • Buckets: 4096 Batches: 1 Memory Usage: 49kB
  • Buffers: shared hit=199934
23. 5.105 123.201 ↑ 17.8 140 1

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

  • Hash Cond: (c.id = c2.id)
  • Buffers: shared hit=199934
24. 6.716 105.793 ↓ 9.0 22,501 1

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

  • Buffers: shared hit=199934
25. 2.141 9.313 ↓ 10.0 22,441 1

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

26.          

Initplan (for Limit)

27. 1.015 3.063 ↑ 1.0 1 1

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

28. 2.048 2.048 ↑ 1.0 22,441 1

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

29. 4.109 4.109 ↑ 1.0 22,441 1

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

30. 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_3.id)
  • Buffers: shared hit=199934
31. 2.940 12.303 ↓ 10.0 22,441 1

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

  • Buckets: 32768 (originally 4096) Batches: 1 (originally 1) Memory Usage: 1133kB
32. 2.363 9.363 ↓ 10.0 22,441 1

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

33. 1.893 7.000 ↓ 10.0 22,441 1

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

34.          

Initplan (for Limit)

35. 1.074 2.620 ↑ 1.0 1 1

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

36. 1.546 1.546 ↑ 1.0 22,441 1

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

37. 2.487 2.487 ↑ 1.0 22,441 1

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

38.          

CTE old_edge

39. 15.102 3,057.707 ↑ 112.7 22,581 1

Nested Loop (cost=0.56..2,572,512.48 rows=2,545,974 width=104) (actual time=2,490.443..3,057.707 rows=22,581 loops=1)

  • Buffers: shared hit=447406 dirtied=11522
40. 2,861.957 2,861.957 ↑ 112.7 22,581 1

CTE Scan on updated_edge_data t_1 (cost=0.00..152,758.44 rows=2,545,974 width=40) (actual time=2,490.387..2,861.957 rows=22,581 loops=1)

  • Buffers: shared hit=334501
41. 180.648 180.648 ↑ 1.0 1 22,581

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

  • Index Cond: (id = t_1.id)
  • Buffers: shared hit=112905 dirtied=11522
42.          

CTE updated_edge

43. 2,160.116 2,330.748 ↑ 112.7 22,581 1

Update on treenode_edge e_1 (cost=0.56..2,578,877.41 rows=2,545,974 width=130) (actual time=0.276..2,330.748 rows=22,581 loops=1)

  • Buffers: shared hit=642426 read=345 dirtied=48661 written=590
44. 20.268 170.632 ↑ 112.7 22,581 1

Nested Loop (cost=0.56..2,578,877.41 rows=2,545,974 width=130) (actual time=0.040..170.632 rows=22,581 loops=1)

  • Buffers: shared hit=112905
45. 37.459 37.459 ↑ 112.7 22,581 1

CTE Scan on updated_edge_data ue_2 (cost=0.00..152,758.44 rows=2,545,974 width=120) (actual time=0.017..37.459 rows=22,581 loops=1)

46. 112.905 112.905 ↑ 1.0 1 22,581

Index Scan using treenode_edge_pkey on treenode_edge e_1 (cost=0.56..0.95 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
47.          

CTE old_skeleton_data

48. 13.922 3,131.033 ↑ 84,865.7 3 1

HashAggregate (cost=659,149.95..668,060.84 rows=254,597 width=48) (actual time=3,128.693..3,131.033 rows=3 loops=1)

  • Group Key: old_edge.skeleton_id, old_edge.project_id, first_value(old_edge.editor_id) OVER (?)
  • Buffers: shared hit=447406 dirtied=11522
49. 16.424 3,117.111 ↑ 112.7 22,581 1

WindowAgg (cost=423,647.35..531,851.25 rows=2,545,974 width=64) (actual time=3,099.013..3,117.111 rows=22,581 loops=1)

  • Buffers: shared hit=447406 dirtied=11522
50. 21.386 3,100.687 ↑ 112.7 22,581 1

Sort (cost=423,647.35..430,012.29 rows=2,545,974 width=64) (actual time=3,098.973..3,100.687 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=447406 dirtied=11522
51. 3,079.301 3,079.301 ↑ 112.7 22,581 1

CTE Scan on old_edge (cost=0.00..152,758.44 rows=2,545,974 width=64) (actual time=2,490.448..3,079.301 rows=22,581 loops=1)

  • Buffers: shared hit=447406 dirtied=11522
52.          

CTE imported_nodes

53. 0.010 0.059 ↓ 0.0 0 1

Hash Join (cost=1,419.82..17,650.41 rows=1 width=16) (actual time=0.059..0.059 rows=0 loops=1)

  • Hash Cond: (osd.skeleton_id = css.skeleton_id)
  • Buffers: shared hit=3
54. 0.001 0.001 ↑ 254,597.0 1 1

CTE Scan on old_skeleton_data osd (cost=0.00..15,275.82 rows=254,597 width=8) (actual time=0.000..0.001 rows=1 loops=1)

55. 0.001 0.048 ↓ 0.0 0 1

Hash (cost=1,419.79..1,419.79 rows=1 width=24) (actual time=0.048..0.048 rows=0 loops=1)

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

Nested Loop (cost=12.11..1,419.79 rows=1 width=24) (actual time=0.047..0.047 rows=0 loops=1)

  • Buffers: shared hit=3
57. 0.001 0.045 ↓ 0.0 0 1

Nested Loop (cost=11.55..1,416.98 rows=1 width=40) (actual time=0.045..0.045 rows=0 loops=1)

  • Buffers: shared hit=3
58. 0.009 0.044 ↓ 0.0 0 1

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

  • Hash Cond: (t_2.skeleton_id = css.skeleton_id)
  • Buffers: shared hit=3
59. 0.003 0.003 ↑ 22,441.0 1 1

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

60. 0.002 0.032 ↓ 0.0 0 1

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

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
61. 0.030 0.030 ↓ 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.030..0.030 rows=0 loops=1)

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

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

63. 0.000 0.000 ↓ 0.0 0

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

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

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

65. 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_2.id)
66. 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_2.id)
67. 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)
68. 0.021 3,208.465 ↑ 48,437.2 4 1

Subquery Scan on s (cost=9,529,534.80..9,545,519.10 rows=193,749 width=60) (actual time=3,207.303..3,208.465 rows=4 loops=1)

  • Buffers: shared hit=447409 dirtied=11522
69. 1.662 3,208.444 ↑ 48,437.2 4 1

HashAggregate (cost=9,529,534.80..9,536,316.02 rows=193,749 width=104) (actual time=3,207.287..3,208.444 rows=4 loops=1)

  • Group Key: os.skeleton_id, os.project_id, first_value(os.last_editor_id) OVER (?)
  • Buffers: shared hit=447409 dirtied=11522
70. 0.031 3,206.782 ↑ 276,783.7 7 1

WindowAgg (cost=9,350,317.35..9,432,660.50 rows=1,937,486 width=56) (actual time=3,206.774..3,206.782 rows=7 loops=1)

  • Buffers: shared hit=447409 dirtied=11522
71. 0.025 3,206.751 ↑ 276,783.7 7 1

Sort (cost=9,350,317.35..9,355,161.06 rows=1,937,486 width=56) (actual time=3,206.750..3,206.751 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=447409 dirtied=11522
72. 0.008 3,206.726 ↑ 276,783.7 7 1

Result (cost=0.16..9,147,988.06 rows=1,937,486 width=56) (actual time=3,128.801..3,206.726 rows=7 loops=1)

  • Buffers: shared hit=447409 dirtied=11522
73. 0.005 3,206.718 ↑ 276,783.7 7 1

Append (cost=0.16..9,089,863.48 rows=1,937,486 width=56) (actual time=3,128.796..3,206.718 rows=7 loops=1)

  • Buffers: shared hit=447409 dirtied=11522
74. 0.033 3,131.139 ↑ 84,865.7 3 1

Hash Left Join (cost=0.16..16,620.41 rows=254,597 width=56) (actual time=3,128.794..3,131.139 rows=3 loops=1)

  • Hash Cond: (os.skeleton_id = ins.skeleton_id)
  • Buffers: shared hit=447409 dirtied=11522
75. 3,131.041 3,131.041 ↑ 84,865.7 3 1

CTE Scan on old_skeleton_data os (cost=0.00..15,275.82 rows=254,597 width=48) (actual time=3,128.698..3,131.041 rows=3 loops=1)

  • Buffers: shared hit=447406 dirtied=11522
76. 0.001 0.065 ↓ 0.0 0 1

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

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
77. 0.001 0.064 ↓ 0.0 0 1

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

  • Buffers: shared hit=3
78. 0.002 0.063 ↓ 0.0 0 1

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

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

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

  • Buffers: shared hit=3
80. 0.026 75.574 ↑ 420,722.2 4 1

Hash Left Join (cost=8,501,753.41..8,986,056.20 rows=1,682,889 width=56) (actual time=68.695..75.574 rows=4 loops=1)

  • Hash Cond: (edge_info.skeleton_id = ins_2.skeleton_id)
81. 5.817 75.515 ↑ 420,722.2 4 1

GroupAggregate (cost=8,500,304.34..8,929,440.99 rows=1,682,889 width=48) (actual time=68.637..75.515 rows=4 loops=1)

  • Group Key: edge_info.skeleton_id, edge_info.project_id, edge_info.last_editor_id
82. 7.190 69.698 ↑ 745.3 22,581 1

Sort (cost=8,500,304.34..8,542,376.56 rows=16,828,888 width=64) (actual time=68.557..69.698 rows=22,581 loops=1)

  • Sort Key: edge_info.skeleton_id, edge_info.project_id, edge_info.last_editor_id
  • Sort Method: quicksort Memory: 3944kB
83. 2.265 62.508 ↑ 745.3 22,581 1

Subquery Scan on edge_info (cost=4,889,771.09..6,109,865.47 rows=16,828,888 width=64) (actual time=48.120..62.508 rows=22,581 loops=1)

84. 10.989 60.243 ↑ 745.3 22,581 1

WindowAgg (cost=4,889,771.09..5,604,998.83 rows=16,828,888 width=64) (actual time=48.115..60.243 rows=22,581 loops=1)

85. 7.577 49.254 ↑ 745.3 22,581 1

Sort (cost=4,889,771.09..4,931,843.31 rows=16,828,888 width=64) (actual time=48.082..49.254 rows=22,581 loops=1)

  • Sort Key: ue.skeleton_id, ue.project_id, ue.edition_time DESC
  • Sort Method: quicksort Memory: 3944kB
86. 2.377 41.677 ↑ 745.3 22,581 1

Result (cost=0.00..2,499,332.22 rows=16,828,888 width=64) (actual time=0.021..41.677 rows=22,581 loops=1)

87. 1.794 39.300 ↑ 745.3 22,581 1

Append (cost=0.00..1,994,465.58 rows=16,828,888 width=64) (actual time=0.017..39.300 rows=22,581 loops=1)

88. 4.144 4.144 ↑ 112.7 22,581 1

CTE Scan on updated_edge_data ue (cost=0.00..152,758.44 rows=2,545,974 width=64) (actual time=0.015..4.144 rows=22,581 loops=1)

89. 0.003 33.362 ↓ 0.0 0 1

Subquery Scan on *SELECT* 2 (cost=660,878.80..1,589,273.82 rows=14,282,914 width=64) (actual time=33.362..33.362 rows=0 loops=1)

90. 0.003 33.359 ↓ 0.0 0 1

Merge Join (cost=660,878.80..1,160,786.40 rows=14,282,914 width=72) (actual time=33.359..33.359 rows=0 loops=1)

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

Sort (cost=237,231.45..237,234.25 rows=1,122 width=40) (actual time=33.356..33.356 rows=0 loops=1)

  • Sort Key: new_treenode.id
  • Sort Method: quicksort Memory: 25kB
92. 15.539 33.341 ↓ 0.0 0 1

Hash Anti Join (cost=236,905.19..237,174.61 rows=1,122 width=40) (actual time=33.341..33.341 rows=0 loops=1)

  • Hash Cond: (new_treenode.id = ue_1.id)
93. 1.759 8.536 ↓ 10.0 22,441 1

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

94.          

Initplan (for Limit)

95. 1.025 3.840 ↑ 1.0 1 1

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

96. 2.815 2.815 ↑ 1.0 22,441 1

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

97. 2.937 2.937 ↑ 1.0 22,441 1

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

98. 4.649 9.266 ↑ 112.7 22,581 1

Hash (cost=152,758.44..152,758.44 rows=2,545,974 width=8) (actual time=9.266..9.266 rows=22,581 loops=1)

  • Buckets: 4194304 Batches: 1 Memory Usage: 33651kB
99. 4.617 4.617 ↑ 112.7 22,581 1

CTE Scan on updated_edge_data ue_1 (cost=0.00..152,758.44 rows=2,545,974 width=8) (actual time=0.025..4.617 rows=22,581 loops=1)

100. 0.000 0.000 ↓ 0.0 0

Sort (cost=423,647.35..430,012.29 rows=2,545,974 width=40) (never executed)

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

CTE Scan on old_edge oe (cost=0.00..152,758.44 rows=2,545,974 width=40) (never executed)

102. 0.001 0.033 ↓ 0.0 0 1

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

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

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

104. 0.004 0.031 ↓ 0.0 0 1

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

  • Group Key: nt.skeleton_id
105. 0.006 0.027 ↓ 0.0 0 1

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

  • Sort Key: nt.skeleton_id
  • Sort Method: quicksort Memory: 25kB
106. 0.007 0.021 ↓ 0.0 0 1

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

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

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

108. 0.000 0.001 ↓ 0.0 0 1

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

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
109. 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)