explain.depesz.com

PostgreSQL's explain analyze made readable

Result: SEXs

Settings
# exclusive inclusive rows x rows loops node
1. 0.405 5,751.833 ↓ 0.0 0 1

Insert on catmaid_skeleton_summary (cost=455,321.70..455,655.50 rows=4,046 width=60) (actual time=5,751.833..5,751.833 rows=0 loops=1)

  • Conflict Resolution: UPDATE
  • Conflict Arbiter Indexes: catmaid_skeleton_id_pkey
  • Tuples Inserted: 1
  • Conflicting Tuples: 3
  • Buffers: shared hit=536387 dirtied=11680
  • JIT:
  • Functions: 221
  • Options: Inlining false, Optimization false, Expressions true, Deforming true
  • Timing: Generation 29.769 ms, Inlining 0.000 ms, Optimization 9.047 ms, Emission 160.081 ms, Total 198.898 ms
2.          

CTE updated_edge_data

3. 4.662 5,296.636 ↑ 2.4 22,581 1

Append (cost=16,091.36..32,537.62 rows=53,160 width=108) (actual time=435.310..5,296.636 rows=22,581 loops=1)

  • Buffers: shared hit=423365
4. 4,648.580 5,093.731 ↑ 1.1 22,441 1

Merge Join (cost=16,091.36..17,990.93 rows=25,178 width=108) (actual time=435.307..5,093.731 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=245366
5. 14.737 422.798 ↓ 10.0 22,441 1

Sort (cost=14,361.91..14,367.52 rows=2,244 width=72) (actual time=418.648..422.798 rows=22,441 loops=1)

  • Sort Key: new_treenode_4.id
  • Sort Method: quicksort Memory: 3924kB
  • Buffers: shared hit=245366
6. 17.320 408.061 ↓ 10.0 22,441 1

Nested Loop (cost=1,405.92..14,237.01 rows=2,244 width=72) (actual time=177.846..408.061 rows=22,441 loops=1)

  • Buffers: shared hit=245366
7. 175.137 188.772 ↓ 10.0 22,441 1

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

8.          

Initplan (for Limit)

9. 1.400 5.294 ↑ 1.0 1 1

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

10. 3.894 3.894 ↑ 1.0 22,441 1

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

11. 8.341 8.341 ↑ 1.0 22,441 1

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

12. 67.323 201.969 ↑ 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.009 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=23447
  • Buffers: shared hit=245366
13. 22.441 134.646 ↓ 0.0 0 22,441

BitmapOr (cost=3.33..3.33 rows=2 width=0) (actual time=0.006..0.006 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. 10.441 22.353 ↓ 10.0 22,441 1

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

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

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

18. 1.717 9.322 ↓ 10.0 22,441 1

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

19.          

Initplan (for Limit)

20. 1.136 4.188 ↑ 1.0 1 1

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

21. 3.052 3.052 ↑ 1.0 22,441 1

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

22. 3.417 3.417 ↑ 1.0 22,441 1

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

23. 60.113 198.243 ↑ 199.9 140 1

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

  • Hash Cond: (old_treenode_3.id = c.parent_id)
  • Buffers: shared hit=177999
24. 1.837 10.529 ↓ 10.0 22,441 1

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

25.          

Initplan (for Limit)

26. 1.216 5.229 ↑ 1.0 1 1

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

27. 4.013 4.013 ↑ 1.0 22,441 1

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

28. 3.463 3.463 ↑ 1.0 22,441 1

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

29. 0.100 127.601 ↑ 17.8 140 1

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

  • Buckets: 4096 Batches: 1 Memory Usage: 49kB
  • Buffers: shared hit=177999
30. 6.169 127.501 ↑ 17.8 140 1

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

  • Hash Cond: (c.id = c2.id)
  • Buffers: shared hit=177999
31. 6.060 107.474 ↓ 9.0 22,501 1

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

  • Buffers: shared hit=177999
32. 2.142 11.650 ↓ 10.0 22,441 1

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

33.          

Initplan (for Limit)

34. 1.266 4.229 ↑ 1.0 1 1

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

35. 2.963 2.963 ↑ 1.0 22,441 1

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

36. 5.279 5.279 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.005..5.279 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=177999
38. 3.552 13.858 ↓ 10.0 22,441 1

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

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

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

40. 1.848 7.820 ↓ 10.0 22,441 1

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

41.          

Initplan (for Limit)

42. 1.236 2.802 ↑ 1.0 1 1

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

43. 1.566 1.566 ↑ 1.0 22,441 1

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

44. 3.170 3.170 ↑ 1.0 22,441 1

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

45.          

CTE old_edge

46. 46.102 5,508.499 ↑ 2.4 22,581 1

Nested Loop (cost=0.56..138,640.50 rows=53,160 width=104) (actual time=435.360..5,508.499 rows=22,581 loops=1)

  • Buffers: shared hit=536270 dirtied=11657
47. 5,326.911 5,326.911 ↑ 2.4 22,581 1

CTE Scan on updated_edge_data t (cost=0.00..3,189.60 rows=53,160 width=40) (actual time=435.314..5,326.911 rows=22,581 loops=1)

  • Buffers: shared hit=423365
48. 135.486 135.486 ↑ 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.006..0.006 rows=1 loops=22,581)

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

CTE updated_edge

50. 4,070.546 4,257.323 ↑ 2.4 22,581 1

Update on treenode_edge e_1 (cost=0.56..138,773.40 rows=53,160 width=130) (actual time=0.321..4,257.323 rows=22,581 loops=1)

  • Buffers: shared hit=656954 read=432 dirtied=41363 written=987
51. 31.303 186.777 ↑ 2.4 22,581 1

Nested Loop (cost=0.56..138,773.40 rows=53,160 width=130) (actual time=0.049..186.777 rows=22,581 loops=1)

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

CTE Scan on updated_edge_data ue_2 (cost=0.00..3,189.60 rows=53,160 width=120) (actual time=0.021..42.569 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. 11.339 5,640.421 ↑ 1,772.0 3 1

HashAggregate (cost=12,279.44..12,465.50 rows=5,316 width=48) (actual time=5,640.364..5,640.421 rows=3 loops=1)

  • Group Key: old_edge.skeleton_id, old_edge.project_id, first_value(old_edge.editor_id) OVER (?)
  • Buffers: shared hit=536270 dirtied=11657
56. 65.286 5,629.082 ↑ 2.4 22,581 1

WindowAgg (cost=7,362.14..9,621.44 rows=53,160 width=64) (actual time=5,562.060..5,629.082 rows=22,581 loops=1)

  • Buffers: shared hit=536270 dirtied=11657
57. 27.167 5,563.796 ↑ 2.4 22,581 1

Sort (cost=7,362.14..7,495.04 rows=53,160 width=64) (actual time=5,562.015..5,563.796 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=536270 dirtied=11657
58. 5,536.629 5,536.629 ↑ 2.4 22,581 1

CTE Scan on old_edge (cost=0.00..3,189.60 rows=53,160 width=64) (actual time=435.368..5,536.629 rows=22,581 loops=1)

  • Buffers: shared hit=536270 dirtied=11657
59.          

CTE imported_nodes

60. 0.002 47.266 ↓ 0.0 0 1

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

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

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

  • Buffers: shared hit=3
62. 47.173 47.262 ↓ 0.0 0 1

Hash Join (cost=1,407.00..1,745.92 rows=1 width=16) (actual time=47.262..47.262 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.088 ↓ 0.0 0 1

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

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

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

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

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

67. 0.001 0.042 ↓ 0.0 0 1

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

  • Buckets: 1024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
68. 0.041 0.041 ↓ 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.041..0.041 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.026 5,751.428 ↑ 1,011.5 4 1

Subquery Scan on s (cost=131,145.94..131,479.73 rows=4,046 width=60) (actual time=5,751.357..5,751.428 rows=4 loops=1)

  • Buffers: shared hit=536273 dirtied=11657
76. 0.099 5,751.402 ↑ 1,011.5 4 1

HashAggregate (cost=131,145.94..131,287.55 rows=4,046 width=104) (actual time=5,751.336..5,751.402 rows=4 loops=1)

  • Group Key: os.skeleton_id, os.project_id, first_value(os.last_editor_id) OVER (?)
  • Buffers: shared hit=536273 dirtied=11657
77. 0.034 5,751.303 ↑ 5,779.3 7 1

WindowAgg (cost=127,403.85..129,123.19 rows=40,455 width=56) (actual time=5,751.294..5,751.303 rows=7 loops=1)

  • Buffers: shared hit=536273 dirtied=11657
78. 0.025 5,751.269 ↑ 5,779.3 7 1

Sort (cost=127,403.85..127,504.99 rows=40,455 width=56) (actual time=5,751.269..5,751.269 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=536273 dirtied=11657
79. 0.009 5,751.244 ↑ 5,779.3 7 1

Result (cost=0.16..124,308.23 rows=40,455 width=56) (actual time=5,687.697..5,751.244 rows=7 loops=1)

  • Buffers: shared hit=536273 dirtied=11657
80. 0.006 5,751.235 ↑ 5,779.3 7 1

Append (cost=0.16..123,094.58 rows=40,455 width=56) (actual time=5,687.692..5,751.235 rows=7 loops=1)

  • Buffers: shared hit=536273 dirtied=11657
81. 0.045 5,687.760 ↑ 1,772.0 3 1

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

  • Hash Cond: (os.skeleton_id = ins.skeleton_id)
  • Buffers: shared hit=536273 dirtied=11657
82. 5,640.439 5,640.439 ↑ 1,772.0 3 1

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

  • Buffers: shared hit=536270 dirtied=11657
83. 0.002 47.276 ↓ 0.0 0 1

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

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

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

  • Buffers: shared hit=3
85. 0.003 47.272 ↓ 0.0 0 1

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

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

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

  • Buffers: shared hit=3
87. 0.035 63.469 ↑ 8,784.8 4 1

Hash Left Join (cost=118,720.84..120,926.90 rows=35,139 width=56) (actual time=63.057..63.469 rows=4 loops=1)

  • Hash Cond: (ue.skeleton_id = ins_2.skeleton_id)
88. 10.919 63.400 ↑ 8,784.8 4 1

HashAggregate (cost=117,271.76..118,325.93 rows=35,139 width=48) (actual time=62.990..63.400 rows=4 loops=1)

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

WindowAgg (cost=84,768.37..99,702.36 rows=351,388 width=64) (actual time=37.262..52.481 rows=22,581 loops=1)

90. 7.452 38.446 ↑ 15.6 22,581 1

Sort (cost=84,768.37..85,646.84 rows=351,388 width=64) (actual time=37.216..38.446 rows=22,581 loops=1)

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

Result (cost=0.00..52,400.79 rows=351,388 width=64) (actual time=0.012..30.994 rows=22,581 loops=1)

92. 1.851 28.474 ↑ 15.6 22,581 1

Append (cost=0.00..41,859.15 rows=351,388 width=64) (actual time=0.007..28.474 rows=22,581 loops=1)

93. 5.925 5.925 ↑ 2.4 22,581 1

CTE Scan on updated_edge_data ue (cost=0.00..3,189.60 rows=53,160 width=64) (actual time=0.006..5.925 rows=22,581 loops=1)

94. 0.002 20.698 ↓ 0.0 0 1

Subquery Scan on *SELECT* 2 (cost=14,008.30..33,398.73 rows=298,228 width=64) (actual time=20.698..20.698 rows=0 loops=1)

95. 0.004 20.696 ↓ 0.0 0 1

Merge Join (cost=14,008.30..24,451.89 rows=298,228 width=72) (actual time=20.696..20.696 rows=0 loops=1)

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

Sort (cost=6,646.15..6,648.96 rows=1,122 width=40) (actual time=20.692..20.692 rows=0 loops=1)

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

Hash Anti Join (cost=6,319.89..6,589.31 rows=1,122 width=40) (actual time=20.674..20.675 rows=0 loops=1)

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

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

99.          

Initplan (for Limit)

100. 1.166 4.112 ↑ 1.0 1 1

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

101. 2.946 2.946 ↑ 1.0 22,441 1

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

102. 4.044 4.044 ↑ 1.0 22,441 1

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

103. 3.431 7.117 ↑ 2.4 22,581 1

Hash (cost=3,189.60..3,189.60 rows=53,160 width=8) (actual time=7.117..7.117 rows=22,581 loops=1)

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

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

105. 0.000 0.000 ↓ 0.0 0

Sort (cost=7,362.14..7,495.04 rows=53,160 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.60 rows=53,160 width=40) (never executed)

107. 0.002 0.034 ↓ 0.0 0 1

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

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

109. 0.003 0.030 ↓ 0.0 0 1

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

  • Group Key: nt.skeleton_id
110. 0.012 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
111. 0.008 0.015 ↓ 0.0 0 1

Hash Join (cost=0.09..1,434.07 rows=112 width=8) (actual time=0.015..0.015 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)