explain.depesz.com

PostgreSQL's explain analyze made readable

Result: 1sKY

Settings
# exclusive inclusive rows x rows loops node
1. 0.160 3,554.845 ↓ 0.0 0 1

Insert on catmaid_skeleton_summary (cost=18,332,013.79..18,347,998.08 rows=193,749 width=60) (actual time=3,554.845..3,554.845 rows=0 loops=1)

  • Conflict Resolution: UPDATE
  • Conflict Arbiter Indexes: catmaid_skeleton_id_pkey
  • Tuples Inserted: 0
  • Conflicting Tuples: 3
  • Buffers: shared hit=200660 dirtied=137
  • JIT:
  • Functions: 219
  • Options: Inlining true, Optimization true, Expressions true, Deforming true
  • Timing: Generation 31.950 ms, Inlining 33.808 ms, Optimization 1562.231 ms, Emission 1008.468 ms, Total 2636.458 ms
2.          

CTE old_new

3. 2,615.505 2,631.477 ↓ 0.0 0 1

Merge Join (cost=5,936.51..125,653.33 rows=2,517,992 width=114) (actual time=2,631.477..2,631.477 rows=0 loops=1)

  • Merge Cond: (t.id = ot.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))
  • Rows Removed by Join Filter: 22441
4. 4.592 5.939 ↑ 1.0 22,441 1

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

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

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

6. 6.744 10.033 ↑ 1.0 22,441 1

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

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

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

8.          

CTE updated_edge_data

9. 0.028 2,776.288 ↑ 18,185.5 140 1

Append (cost=0.56..2,839,759.72 rows=2,545,974 width=108) (actual time=2,769.439..2,776.288 rows=140 loops=1)

  • Buffers: shared hit=199931
10. 0.005 2,631.484 ↓ 0.0 0 1

Nested Loop (cost=0.56..2,527,015.78 rows=2,505,402 width=108) (actual time=2,631.484..2,631.484 rows=0 loops=1)

11. 2,631.479 2,631.479 ↓ 0.0 0 1

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

  • Filter: (parent_id IS NOT NULL)
12. 0.000 0.000 ↓ 0.0 0

Index Scan using treenode_id_pkey on treenode p (cost=0.56..0.92 rows=1 width=20) (never executed)

  • Index Cond: (id = ton.parent_id)
13. 0.001 0.002 ↓ 0.0 0 1

Nested Loop (cost=0.56..186,020.62 rows=12,590 width=108) (actual time=0.002..0.002 rows=0 loops=1)

14. 0.001 0.001 ↓ 0.0 0 1

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

  • Filter: (parent_id IS NULL)
15. 0.000 0.000 ↓ 0.0 0

Index Scan using treenode_id_pkey on treenode p_1 (cost=0.56..2.75 rows=1 width=20) (never executed)

  • Index Cond: (id = ton_1.id)
16. 2.744 144.774 ↑ 199.9 140 1

Hash Join (cost=11,174.58..12,154.49 rows=27,982 width=108) (actual time=137.947..144.774 rows=140 loops=1)

  • Hash Cond: (old_treenode_1.id = c.parent_id)
  • Buffers: shared hit=199931
17. 1.817 8.051 ↓ 10.0 22,441 1

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

18.          

Initplan (for Limit)

19. 1.070 3.405 ↑ 1.0 1 1

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

20. 2.335 2.335 ↑ 1.0 22,441 1

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

21. 2.829 2.829 ↑ 1.0 22,441 1

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

22. 0.094 133.979 ↑ 17.8 140 1

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

  • Buckets: 4096 Batches: 1 Memory Usage: 49kB
  • Buffers: shared hit=199931
23. 5.206 133.885 ↑ 17.8 140 1

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

  • Hash Cond: (c.id = c2.id)
  • Buffers: shared hit=199931
24. 14.228 114.744 ↓ 9.0 22,501 1

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

  • Buffers: shared hit=199931
25. 2.085 10.752 ↓ 10.0 22,441 1

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

26.          

Initplan (for Limit)

27. 1.037 3.183 ↑ 1.0 1 1

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

28. 2.146 2.146 ↑ 1.0 22,441 1

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

29. 5.484 5.484 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.002..5.484 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.004..0.004 rows=1 loops=22,441)

  • Index Cond: (parent_id = new_treenode_3.id)
  • Buffers: shared hit=199931
31. 3.266 13.935 ↓ 10.0 22,441 1

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

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

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

33. 3.386 8.337 ↓ 10.0 22,441 1

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

34.          

Initplan (for Limit)

35. 1.019 2.419 ↑ 1.0 1 1

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

36. 1.400 1.400 ↑ 1.0 22,441 1

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

37. 2.532 2.532 ↑ 1.0 22,441 1

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

38.          

CTE old_edge

39. 0.164 2,777.426 ↑ 18,185.5 140 1

Nested Loop (cost=0.56..2,572,494.88 rows=2,545,974 width=104) (actual time=2,769.501..2,777.426 rows=140 loops=1)

  • Buffers: shared hit=200633 dirtied=136
40. 2,776.422 2,776.422 ↑ 18,185.5 140 1

CTE Scan on updated_edge_data t_1 (cost=0.00..152,758.44 rows=2,545,974 width=40) (actual time=2,769.444..2,776.422 rows=140 loops=1)

  • Buffers: shared hit=199931
41. 0.840 0.840 ↑ 1.0 1 140

Index Scan using treenode_edge_pkey on treenode_edge e (cost=0.56..0.95 rows=1 width=72) (actual time=0.006..0.006 rows=1 loops=140)

  • Index Cond: (id = t_1.id)
  • Buffers: shared hit=702 dirtied=136
42.          

CTE updated_edge

43. 14.426 15.747 ↑ 18,185.5 140 1

Update on treenode_edge e_1 (cost=0.56..2,578,859.81 rows=2,545,974 width=130) (actual time=0.670..15.747 rows=140 loops=1)

  • Buffers: shared hit=4188 read=4 dirtied=518 written=12
44. 0.251 1.321 ↑ 18,185.5 140 1

Nested Loop (cost=0.56..2,578,859.81 rows=2,545,974 width=130) (actual time=0.048..1.321 rows=140 loops=1)

  • Buffers: shared hit=702
45. 0.230 0.230 ↑ 18,185.5 140 1

CTE Scan on updated_edge_data ue_2 (cost=0.00..152,758.44 rows=2,545,974 width=120) (actual time=0.020..0.230 rows=140 loops=1)

46. 0.840 0.840 ↑ 1.0 1 140

Index Scan using treenode_edge_pkey on treenode_edge e_1 (cost=0.56..0.95 rows=1 width=18) (actual time=0.006..0.006 rows=1 loops=140)

  • Index Cond: (id = ue_2.id)
  • Buffers: shared hit=702
47.          

CTE old_skeleton_data

48. 3.196 2,781.024 ↑ 84,865.7 3 1

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

  • Group Key: old_edge.skeleton_id, old_edge.project_id, first_value(old_edge.editor_id) OVER (?)
  • Buffers: shared hit=200633 dirtied=136
49. 0.130 2,777.828 ↑ 18,185.5 140 1

WindowAgg (cost=423,647.35..531,851.25 rows=2,545,974 width=64) (actual time=2,777.716..2,777.828 rows=140 loops=1)

  • Buffers: shared hit=200633 dirtied=136
50. 0.123 2,777.698 ↑ 18,185.5 140 1

Sort (cost=423,647.35..430,012.29 rows=2,545,974 width=64) (actual time=2,777.688..2,777.698 rows=140 loops=1)

  • Sort Key: old_edge.skeleton_id, old_edge.project_id, old_edge.edition_time DESC
  • Sort Method: quicksort Memory: 44kB
  • Buffers: shared hit=200633 dirtied=136
51. 2,777.575 2,777.575 ↑ 18,185.5 140 1

CTE Scan on old_edge (cost=0.00..152,758.44 rows=2,545,974 width=64) (actual time=2,769.508..2,777.575 rows=140 loops=1)

  • Buffers: shared hit=200633 dirtied=136
52.          

CTE imported_nodes

53. 0.027 0.092 ↓ 0.0 0 1

Hash Join (cost=1,419.82..17,650.41 rows=1 width=16) (actual time=0.092..0.092 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.001..0.001 rows=1 loops=1)

55. 0.001 0.064 ↓ 0.0 0 1

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

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

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

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

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

  • Buffers: shared hit=3
58. 0.029 0.060 ↓ 0.0 0 1

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

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

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

60. 0.001 0.024 ↓ 0.0 0 1

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

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
61. 0.023 0.023 ↓ 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.023..0.023 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.032 3,554.685 ↑ 64,583.0 3 1

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

  • Buffers: shared hit=200636 dirtied=136
69. 1.686 3,554.653 ↑ 64,583.0 3 1

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

  • Group Key: os.skeleton_id, os.project_id, first_value(os.last_editor_id) OVER (?)
  • Buffers: shared hit=200636 dirtied=136
70. 0.040 3,552.967 ↑ 322,914.3 6 1

WindowAgg (cost=9,350,317.35..9,432,660.50 rows=1,937,486 width=56) (actual time=3,552.960..3,552.967 rows=6 loops=1)

  • Buffers: shared hit=200636 dirtied=136
71. 0.022 3,552.927 ↑ 322,914.3 6 1

Sort (cost=9,350,317.35..9,355,161.06 rows=1,937,486 width=56) (actual time=3,552.926..3,552.927 rows=6 loops=1)

  • Sort Key: os.skeleton_id, os.project_id, os.max_edition_time DESC
  • Sort Method: quicksort Memory: 25kB
  • Buffers: shared hit=200636 dirtied=136
72. 0.011 3,552.905 ↑ 322,914.3 6 1

Result (cost=0.16..9,147,988.06 rows=1,937,486 width=56) (actual time=2,778.977..3,552.905 rows=6 loops=1)

  • Buffers: shared hit=200636 dirtied=136
73. 0.005 3,552.894 ↑ 322,914.3 6 1

Append (cost=0.16..9,089,863.48 rows=1,937,486 width=56) (actual time=2,778.969..3,552.894 rows=6 loops=1)

  • Buffers: shared hit=200636 dirtied=136
74. 0.066 2,781.196 ↑ 84,865.7 3 1

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

  • Hash Cond: (os.skeleton_id = ins.skeleton_id)
  • Buffers: shared hit=200636 dirtied=136
75. 2,781.031 2,781.031 ↑ 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=2,778.803..2,781.031 rows=3 loops=1)

  • Buffers: shared hit=200633 dirtied=136
76. 0.001 0.099 ↓ 0.0 0 1

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

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

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

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

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

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

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

  • Buffers: shared hit=3
80. 0.032 771.693 ↑ 560,963.0 3 1

Hash Left Join (cost=8,501,753.41..8,986,056.20 rows=1,682,889 width=56) (actual time=771.689..771.693 rows=3 loops=1)

  • Hash Cond: (edge_info.skeleton_id = ins_2.skeleton_id)
81. 0.077 771.623 ↑ 560,963.0 3 1

GroupAggregate (cost=8,500,304.34..8,929,440.99 rows=1,682,889 width=48) (actual time=771.620..771.623 rows=3 loops=1)

  • Group Key: edge_info.skeleton_id, edge_info.project_id, edge_info.last_editor_id
82. 0.073 771.546 ↑ 120,206.3 140 1

Sort (cost=8,500,304.34..8,542,376.56 rows=16,828,888 width=64) (actual time=771.539..771.546 rows=140 loops=1)

  • Sort Key: edge_info.skeleton_id, edge_info.project_id, edge_info.last_editor_id
  • Sort Method: quicksort Memory: 44kB
83. 0.024 771.473 ↑ 120,206.3 140 1

Subquery Scan on edge_info (cost=4,889,771.09..6,109,865.47 rows=16,828,888 width=64) (actual time=771.369..771.473 rows=140 loops=1)

84. 0.126 771.449 ↑ 120,206.3 140 1

WindowAgg (cost=4,889,771.09..5,604,998.83 rows=16,828,888 width=64) (actual time=771.361..771.449 rows=140 loops=1)

85. 0.092 771.323 ↑ 120,206.3 140 1

Sort (cost=4,889,771.09..4,931,843.31 rows=16,828,888 width=64) (actual time=771.314..771.323 rows=140 loops=1)

  • Sort Key: ue.skeleton_id, ue.project_id, ue.edition_time DESC
  • Sort Method: quicksort Memory: 44kB
86. 0.025 771.231 ↑ 120,206.3 140 1

Result (cost=0.00..2,499,332.22 rows=16,828,888 width=64) (actual time=0.029..771.231 rows=140 loops=1)

87. 0.014 771.206 ↑ 120,206.3 140 1

Append (cost=0.00..1,994,465.58 rows=16,828,888 width=64) (actual time=0.020..771.206 rows=140 loops=1)

88. 0.045 0.045 ↑ 18,185.5 140 1

CTE Scan on updated_edge_data ue (cost=0.00..152,758.44 rows=2,545,974 width=64) (actual time=0.019..0.045 rows=140 loops=1)

89. 0.003 771.147 ↓ 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=771.147..771.147 rows=0 loops=1)

90. 1.711 771.144 ↓ 0.0 0 1

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

  • Merge Cond: (new_treenode.id = oe.id)
91. 5.717 769.336 ↓ 20.0 22,441 1

Sort (cost=237,231.45..237,234.25 rows=1,122 width=40) (actual time=768.196..769.336 rows=22,441 loops=1)

  • Sort Key: new_treenode.id
  • Sort Method: quicksort Memory: 2522kB
92. 754.678 763.619 ↓ 20.0 22,441 1

Hash Anti Join (cost=236,905.19..237,174.61 rows=1,122 width=40) (actual time=753.187..763.619 rows=22,441 loops=1)

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

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

94.          

Initplan (for Limit)

95. 1.058 3.879 ↑ 1.0 1 1

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

96. 2.821 2.821 ↑ 1.0 22,441 1

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

97. 3.209 3.209 ↑ 1.0 22,441 1

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

98. 0.058 0.115 ↑ 18,185.5 140 1

Hash (cost=152,758.44..152,758.44 rows=2,545,974 width=8) (actual time=0.115..0.115 rows=140 loops=1)

  • Buckets: 4194304 Batches: 1 Memory Usage: 32774kB
99. 0.057 0.057 ↑ 18,185.5 140 1

CTE Scan on updated_edge_data ue_1 (cost=0.00..152,758.44 rows=2,545,974 width=8) (actual time=0.036..0.057 rows=140 loops=1)

100. 0.064 0.097 ↑ 2,545,974.0 1 1

Sort (cost=423,647.35..430,012.29 rows=2,545,974 width=40) (actual time=0.097..0.097 rows=1 loops=1)

  • Sort Key: oe.id
  • Sort Method: quicksort Memory: 44kB
101. 0.033 0.033 ↑ 18,185.5 140 1

CTE Scan on old_edge oe (cost=0.00..152,758.44 rows=2,545,974 width=40) (actual time=0.010..0.033 rows=140 loops=1)

102. 0.001 0.038 ↓ 0.0 0 1

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

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

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

104. 0.004 0.036 ↓ 0.0 0 1

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

  • Group Key: nt.skeleton_id
105. 0.012 0.032 ↓ 0.0 0 1

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

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

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

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

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

108. 0.000 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
109. 0.002 0.002 ↓ 0.0 0 1

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