explain.depesz.com

PostgreSQL's explain analyze made readable

Result: OSi

Settings
# exclusive inclusive rows x rows loops node
1. 0.171 3,400.640 ↓ 0.0 0 1

Insert on catmaid_skeleton_summary (cost=15,811,575.82..15,827,560.12 rows=193,749 width=60) (actual time=3,400.640..3,400.640 rows=0 loops=1)

  • Conflict Resolution: UPDATE
  • Conflict Arbiter Indexes: catmaid_skeleton_id_pkey
  • Tuples Inserted: 0
  • Conflicting Tuples: 3
  • Buffers: shared hit=469417
  • JIT:
  • Functions: 213
  • Options: Inlining true, Optimization true, Expressions true, Deforming true
  • Timing: Generation 29.320 ms, Inlining 35.132 ms, Optimization 1289.702 ms, Emission 893.726 ms, Total 2247.880 ms
2.          

CTE updated_edge_data

3. 0.024 2,619.016 ↑ 18,185.5 140 1

Append (cost=129,296.76..444,981.69 rows=2,545,974 width=108) (actual time=2,612.620..2,619.016 rows=140 loops=1)

  • Buffers: shared hit=468688
4. 7.473 2,478.567 ↓ 0.0 0 1

Merge Join (cost=129,296.76..318,258.37 rows=2,517,992 width=108) (actual time=2,478.567..2,478.567 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
  • Buffers: shared hit=268757
5. 11.197 2,462.948 ↑ 1.0 22,441 1

Sort (cost=126,328.51..126,384.61 rows=22,441 width=72) (actual time=2,461.699..2,462.948 rows=22,441 loops=1)

  • Sort Key: t.id
  • Sort Method: quicksort Memory: 3924kB
  • Buffers: shared hit=268757
6. 21.062 2,451.751 ↑ 1.0 22,441 1

Nested Loop (cost=3.20..124,706.71 rows=22,441 width=72) (actual time=2,221.980..2,451.751 rows=22,441 loops=1)

  • Buffers: shared hit=268757
7. 2,228.720 2,228.720 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=60) (actual time=2,221.876..2,228.720 rows=22,441 loops=1)

8. 89.764 201.969 ↑ 1.0 1 22,441

Bitmap Heap Scan on treenode p (cost=3.20..5.47 rows=1 width=20) (actual time=0.009..0.009 rows=1 loops=22,441)

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

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

  • Buffers: shared hit=179524
10. 67.323 67.323 ↓ 3.0 3 22,441

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

  • Index Cond: (id = t.parent_id)
  • Buffers: shared hit=89760
11. 44.882 44.882 ↓ 3.0 3 22,441

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

  • Index Cond: (id = t.id)
  • Buffers: shared hit=89764
12. 5.668 8.146 ↑ 1.0 22,441 1

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

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

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

14. 2.509 140.425 ↑ 199.9 140 1

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

  • Hash Cond: (old_treenode_1.id = c.parent_id)
  • Buffers: shared hit=199931
15. 1.798 7.370 ↓ 10.0 22,441 1

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

16.          

Initplan (for Limit)

17. 1.097 3.017 ↑ 1.0 1 1

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

18. 1.920 1.920 ↑ 1.0 22,441 1

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

19. 2.555 2.555 ↑ 1.0 22,441 1

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

20. 0.083 130.546 ↑ 17.8 140 1

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

  • Buckets: 4096 Batches: 1 Memory Usage: 49kB
  • Buffers: shared hit=199931
21. 5.143 130.463 ↑ 17.8 140 1

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

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

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

  • Buffers: shared hit=199931
23. 2.054 9.301 ↓ 10.0 22,441 1

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

24.          

Initplan (for Limit)

25. 1.069 3.131 ↑ 1.0 1 1

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

26. 2.062 2.062 ↑ 1.0 22,441 1

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

27. 4.116 4.116 ↑ 1.0 22,441 1

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

28. 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
29. 3.110 12.073 ↓ 10.0 22,441 1

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

  • Buckets: 32768 (originally 4096) Batches: 1 (originally 1) Memory Usage: 1133kB
30. 2.274 8.963 ↓ 10.0 22,441 1

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

31. 1.738 6.689 ↓ 10.0 22,441 1

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

32.          

Initplan (for Limit)

33. 1.101 2.534 ↑ 1.0 1 1

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

34. 1.433 1.433 ↑ 1.0 22,441 1

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

35. 2.417 2.417 ↑ 1.0 22,441 1

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

36.          

CTE old_edge

37. 0.105 2,620.071 ↑ 18,185.5 140 1

Nested Loop (cost=0.56..2,572,491.58 rows=2,545,974 width=104) (actual time=2,612.664..2,620.071 rows=140 loops=1)

  • Buffers: shared hit=469390
38. 2,619.126 2,619.126 ↑ 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,612.623..2,619.126 rows=140 loops=1)

  • Buffers: shared hit=468688
39. 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
40.          

CTE updated_edge

41. 15.054 16.376 ↑ 18,185.5 140 1

Update on treenode_edge e_1 (cost=0.56..2,578,856.51 rows=2,545,974 width=130) (actual time=0.361..16.376 rows=140 loops=1)

  • Buffers: shared hit=4034 read=6 dirtied=491 written=5
42. 0.262 1.322 ↑ 18,185.5 140 1

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

  • Buffers: shared hit=702
43. 0.220 0.220 ↑ 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.220 rows=140 loops=1)

44. 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
45.          

CTE old_skeleton_data

46. 3.317 2,623.763 ↑ 84,865.7 3 1

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

  • Group Key: old_edge.skeleton_id, old_edge.project_id, first_value(old_edge.editor_id) OVER (?)
  • Buffers: shared hit=469390
47. 0.123 2,620.446 ↑ 18,185.5 140 1

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

  • Buffers: shared hit=469390
48. 0.121 2,620.323 ↑ 18,185.5 140 1

Sort (cost=423,647.35..430,012.29 rows=2,545,974 width=64) (actual time=2,620.313..2,620.323 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=469390
49. 2,620.202 2,620.202 ↑ 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,612.672..2,620.202 rows=140 loops=1)

  • Buffers: shared hit=469390
50.          

CTE imported_nodes

51. 0.024 0.075 ↓ 0.0 0 1

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

  • Hash Cond: (osd.skeleton_id = css.skeleton_id)
  • Buffers: shared hit=3
52. 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)

53. 0.001 0.050 ↓ 0.0 0 1

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

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

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

  • Buffers: shared hit=3
55. 0.002 0.048 ↓ 0.0 0 1

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

  • Buffers: shared hit=3
56. 0.018 0.046 ↓ 0.0 0 1

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

  • Hash Cond: (t_2.skeleton_id = css.skeleton_id)
  • Buffers: shared hit=3
57. 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)

58. 0.000 0.023 ↓ 0.0 0 1

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

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

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

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

61. 0.000 0.000 ↓ 0.0 0

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

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

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

63. 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)
64. 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)
65. 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)
66. 0.024 3,400.469 ↑ 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,399.753..3,400.469 rows=3 loops=1)

  • Buffers: shared hit=469393
67. 1.670 3,400.445 ↑ 64,583.0 3 1

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

  • Group Key: os.skeleton_id, os.project_id, first_value(os.last_editor_id) OVER (?)
  • Buffers: shared hit=469393
68. 0.040 3,398.775 ↑ 322,914.3 6 1

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

  • Buffers: shared hit=469393
69. 0.018 3,398.735 ↑ 322,914.3 6 1

Sort (cost=9,350,317.35..9,355,161.06 rows=1,937,486 width=56) (actual time=3,398.734..3,398.735 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=469393
70. 0.021 3,398.717 ↑ 322,914.3 6 1

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

  • Buffers: shared hit=469393
71. 0.003 3,398.696 ↑ 322,914.3 6 1

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

  • Buffers: shared hit=469393
72. 0.044 2,623.895 ↑ 84,865.7 3 1

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

  • Hash Cond: (os.skeleton_id = ins.skeleton_id)
  • Buffers: shared hit=469393
73. 2,623.770 2,623.770 ↑ 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,621.443..2,623.770 rows=3 loops=1)

  • Buffers: shared hit=469390
74. 0.001 0.081 ↓ 0.0 0 1

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

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

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

  • Buffers: shared hit=3
76. 0.002 0.078 ↓ 0.0 0 1

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

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

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

  • Buffers: shared hit=3
78. 0.031 774.798 ↑ 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=774.794..774.798 rows=3 loops=1)

  • Hash Cond: (edge_info.skeleton_id = ins_2.skeleton_id)
79. 0.079 774.733 ↑ 560,963.0 3 1

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

  • Group Key: edge_info.skeleton_id, edge_info.project_id, edge_info.last_editor_id
80. 0.069 774.654 ↑ 120,206.3 140 1

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

  • Sort Key: edge_info.skeleton_id, edge_info.project_id, edge_info.last_editor_id
  • Sort Method: quicksort Memory: 44kB
81. 0.039 774.585 ↑ 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=774.452..774.585 rows=140 loops=1)

82. 0.157 774.546 ↑ 120,206.3 140 1

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

83. 0.100 774.389 ↑ 120,206.3 140 1

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

  • Sort Key: ue.skeleton_id, ue.project_id, ue.edition_time DESC
  • Sort Method: quicksort Memory: 44kB
84. 0.024 774.289 ↑ 120,206.3 140 1

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

85. 0.013 774.265 ↑ 120,206.3 140 1

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

86. 0.037 0.037 ↑ 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.013..0.037 rows=140 loops=1)

87. 0.002 774.215 ↓ 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=774.215..774.215 rows=0 loops=1)

88. 1.687 774.213 ↓ 0.0 0 1

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

  • Merge Cond: (new_treenode.id = oe.id)
89. 5.894 772.443 ↓ 20.0 22,441 1

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

  • Sort Key: new_treenode.id
  • Sort Method: quicksort Memory: 2522kB
90. 757.754 766.549 ↓ 20.0 22,441 1

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

  • Hash Cond: (new_treenode.id = ue_1.id)
91. 1.797 8.676 ↓ 10.0 22,441 1

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

92.          

Initplan (for Limit)

93. 1.090 3.594 ↑ 1.0 1 1

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

94. 2.504 2.504 ↑ 1.0 22,441 1

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

95. 3.285 3.285 ↑ 1.0 22,441 1

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

96. 0.058 0.119 ↑ 18,185.5 140 1

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

  • Buckets: 4194304 Batches: 1 Memory Usage: 32774kB
97. 0.061 0.061 ↑ 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.040..0.061 rows=140 loops=1)

98. 0.050 0.083 ↑ 2,545,974.0 1 1

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

  • Sort Key: oe.id
  • Sort Method: quicksort Memory: 44kB
99. 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.011..0.033 rows=140 loops=1)

100. 0.000 0.034 ↓ 0.0 0 1

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

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
101. 0.002 0.034 ↓ 0.0 0 1

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

102. 0.005 0.032 ↓ 0.0 0 1

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

  • Group Key: nt.skeleton_id
103. 0.005 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
104. 0.010 0.022 ↓ 0.0 0 1

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

  • Hash Cond: (nt.id = ins_3.id)
105. 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)

106. 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
107. 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)