explain.depesz.com

PostgreSQL's explain analyze made readable

Result: QC6n

Settings
# exclusive inclusive rows x rows loops node
1. 0.320 4,650.875 ↓ 0.0 0 1

Insert on catmaid_skeleton_summary (cost=455,308.50..455,642.30 rows=4,046 width=60) (actual time=4,650.875..4,650.875 rows=0 loops=1)

  • Conflict Resolution: UPDATE
  • Conflict Arbiter Indexes: catmaid_skeleton_id_pkey
  • Tuples Inserted: 1
  • Conflicting Tuples: 3
  • Buffers: shared hit=536,396
  • JIT:
  • Functions: 221
  • Options: Inlining false, Optimization false, Expressions true, Deforming true
  • Timing: Generation 27.818 ms, Inlining 0.000 ms, Optimization 6.925 ms, Emission 154.167 ms, Total 188.910 ms
2.          

CTE updated_edge_data

3. 4.369 4,315.213 ↑ 2.4 22,581 1

Append (cost=16,091.36..32,537.62 rows=53,160 width=108) (actual time=418.919..4,315.213 rows=22,581 loops=1)

  • Buffers: shared hit=423,374
4. 3,706.363 4,134.437 ↑ 1.1 22,441 1

Merge Join (cost=16,091.36..17,990.93 rows=25,178 width=108) (actual time=418.918..4,134.437 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=245,373
5. 13.766 406.667 ↓ 10.0 22,441 1

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

  • Sort Key: new_treenode_4.id
  • Sort Method: quicksort Memory: 3,924kB
  • Buffers: shared hit=245,373
6. 35.483 392.901 ↓ 10.0 22,441 1

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

  • Buffers: shared hit=245,373
7. 166.368 177.890 ↓ 10.0 22,441 1

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

8.          

Initplan (for Limit)

9. 1.171 4.225 ↑ 1.0 1 1

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

10. 3.054 3.054 ↑ 1.0 22,441 1

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

11. 7.297 7.297 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.002..7.297 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=23,454
  • Buffers: shared hit=245,373
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=179,524
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=89,760
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=89,764
16. 9.746 21.407 ↓ 10.0 22,441 1

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

  • Sort Key: ot.id
  • Sort Method: quicksort Memory: 3,924kB
17. 2.588 11.661 ↓ 10.0 22,441 1

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

18. 1.763 9.073 ↓ 10.0 22,441 1

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

19.          

Initplan (for Limit)

20. 1.141 3.850 ↑ 1.0 1 1

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

21. 2.709 2.709 ↑ 1.0 22,441 1

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

22. 3.460 3.460 ↑ 1.0 22,441 1

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

23. 40.761 176.407 ↑ 199.9 140 1

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

  • Hash Cond: (old_treenode_3.id = c.parent_id)
  • Buffers: shared hit=178,001
24. 1.807 9.997 ↓ 10.0 22,441 1

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

25.          

Initplan (for Limit)

26. 1.188 4.960 ↑ 1.0 1 1

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

27. 3.772 3.772 ↑ 1.0 22,441 1

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

28. 3.230 3.230 ↑ 1.0 22,441 1

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

29. 0.090 125.649 ↑ 17.8 140 1

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

  • Buckets: 4,096 Batches: 1 Memory Usage: 49kB
  • Buffers: shared hit=178,001
30. 6.339 125.559 ↑ 17.8 140 1

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

  • Hash Cond: (c.id = c2.id)
  • Buffers: shared hit=178,001
31. 5.525 106.242 ↓ 9.0 22,501 1

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

  • Buffers: shared hit=178,001
32. 2.128 10.953 ↓ 10.0 22,441 1

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

33.          

Initplan (for Limit)

34. 1.173 3.932 ↑ 1.0 1 1

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

35. 2.759 2.759 ↑ 1.0 22,441 1

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

36. 4.893 4.893 ↑ 1.0 22,441 1

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=78) (actual time=0.003..4.893 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=178,001
38. 3.255 12.978 ↓ 10.0 22,441 1

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

  • Buckets: 32,768 (originally 4096) Batches: 1 (originally 1) Memory Usage: 1,133kB
39. 2.374 9.723 ↓ 10.0 22,441 1

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

40. 1.778 7.349 ↓ 10.0 22,441 1

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

41.          

Initplan (for Limit)

42. 1.235 2.812 ↑ 1.0 1 1

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

43. 1.577 1.577 ↑ 1.0 22,441 1

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

44. 2.759 2.759 ↑ 1.0 22,441 1

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

45.          

CTE old_edge

46. 30.994 4,508.505 ↑ 2.4 22,581 1

Nested Loop (cost=0.56..138,633.90 rows=53,160 width=104) (actual time=418.972..4,508.505 rows=22,581 loops=1)

  • Buffers: shared hit=536,279
47. 4,342.025 4,342.025 ↑ 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=418.922..4,342.025 rows=22,581 loops=1)

  • Buffers: shared hit=423,374
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=112,905
49.          

CTE updated_edge

50. 1,612.485 1,783.807 ↑ 2.4 22,581 1

Update on treenode_edge e_1 (cost=0.56..138,766.80 rows=53,160 width=130) (actual time=0.250..1,783.807 rows=22,581 loops=1)

  • Buffers: shared hit=658,824 read=414 dirtied=12,116 written=969
51. 18.387 171.322 ↑ 2.4 22,581 1

Nested Loop (cost=0.56..138,766.80 rows=53,160 width=130) (actual time=0.047..171.322 rows=22,581 loops=1)

  • Buffers: shared hit=112,905
52. 40.030 40.030 ↑ 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..40.030 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=112,905
54.          

CTE old_skeleton_data

55. 11.317 4,589.694 ↑ 1,772.0 3 1

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

  • Group Key: old_edge.skeleton_id, old_edge.project_id, first_value(old_edge.editor_id) OVER (?)
  • Buffers: shared hit=536,279
56. 17.041 4,578.377 ↑ 2.4 22,581 1

WindowAgg (cost=7,362.14..9,621.44 rows=53,160 width=64) (actual time=4,559.789..4,578.377 rows=22,581 loops=1)

  • Buffers: shared hit=536,279
57. 25.614 4,561.336 ↑ 2.4 22,581 1

Sort (cost=7,362.14..7,495.04 rows=53,160 width=64) (actual time=4,559.751..4,561.336 rows=22,581 loops=1)

  • Sort Key: old_edge.skeleton_id, old_edge.project_id, old_edge.edition_time DESC
  • Sort Method: quicksort Memory: 3,944kB
  • Buffers: shared hit=536,279
58. 4,535.722 4,535.722 ↑ 2.4 22,581 1

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

  • Buffers: shared hit=536,279
59.          

CTE imported_nodes

60. 0.001 0.063 ↓ 0.0 0 1

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

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

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

  • Buffers: shared hit=3
62. 0.014 0.060 ↓ 0.0 0 1

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

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

  • Buckets: 1,024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
65. 0.011 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_1.skeleton_id = css.skeleton_id)
  • Buffers: shared hit=3
66. 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)

67. 0.001 0.028 ↓ 0.0 0 1

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

  • Buckets: 1,024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
68. 0.027 0.027 ↓ 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.027..0.027 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.024 4,650.555 ↑ 1,011.5 4 1

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

  • Buffers: shared hit=536,282
76. 0.084 4,650.531 ↑ 1,011.5 4 1

HashAggregate (cost=131,145.94..131,287.55 rows=4,046 width=104) (actual time=4,650.476..4,650.531 rows=4 loops=1)

  • Group Key: os.skeleton_id, os.project_id, first_value(os.last_editor_id) OVER (?)
  • Buffers: shared hit=536,282
77. 0.037 4,650.447 ↑ 5,779.3 7 1

WindowAgg (cost=127,403.85..129,123.19 rows=40,455 width=56) (actual time=4,650.430..4,650.447 rows=7 loops=1)

  • Buffers: shared hit=536,282
78. 0.019 4,650.410 ↑ 5,779.3 7 1

Sort (cost=127,403.85..127,504.99 rows=40,455 width=56) (actual time=4,650.409..4,650.410 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=536,282
79. 0.007 4,650.391 ↑ 5,779.3 7 1

Result (cost=0.16..124,308.23 rows=40,455 width=56) (actual time=4,589.753..4,650.391 rows=7 loops=1)

  • Buffers: shared hit=536,282
80. 0.005 4,650.384 ↑ 5,779.3 7 1

Append (cost=0.16..123,094.58 rows=40,455 width=56) (actual time=4,589.749..4,650.384 rows=7 loops=1)

  • Buffers: shared hit=536,282
81. 0.030 4,589.801 ↑ 1,772.0 3 1

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

  • Hash Cond: (os.skeleton_id = ins.skeleton_id)
  • Buffers: shared hit=536,282
82. 4,589.701 4,589.701 ↑ 1,772.0 3 1

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

  • Buffers: shared hit=536,279
83. 0.001 0.070 ↓ 0.0 0 1

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

  • Buckets: 1,024 Batches: 1 Memory Usage: 8kB
  • Buffers: shared hit=3
84. 0.001 0.069 ↓ 0.0 0 1

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

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

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

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

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

  • Buffers: shared hit=3
87. 0.023 60.578 ↑ 8,784.8 4 1

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

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

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

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

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

90. 7.294 36.204 ↑ 15.6 22,581 1

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

  • Sort Key: ue.skeleton_id, ue.project_id, ue.edition_time DESC
  • Sort Method: quicksort Memory: 3,944kB
91. 2.457 28.910 ↑ 15.6 22,581 1

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

92. 1.841 26.453 ↑ 15.6 22,581 1

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

93. 5.511 5.511 ↑ 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.004..5.511 rows=22,581 loops=1)

94. 0.002 19.101 ↓ 0.0 0 1

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

95. 0.002 19.099 ↓ 0.0 0 1

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

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

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

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

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

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

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

99.          

Initplan (for Limit)

100. 1.153 3.935 ↑ 1.0 1 1

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

101. 2.782 2.782 ↑ 1.0 22,441 1

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

102. 3.496 3.496 ↑ 1.0 22,441 1

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

103. 3.263 6.815 ↑ 2.4 22,581 1

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

  • Buckets: 65,536 Batches: 1 Memory Usage: 1,395kB
104. 3.552 3.552 ↑ 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.552 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.001 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: 1,024 Batches: 1 Memory Usage: 8kB
108. 0.002 0.033 ↓ 0.0 0 1

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

109. 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
110. 0.010 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.011 0.017 ↓ 0.0 0 1

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

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

Named Tuplestore Scan (cost=0.00..1,346.46 rows=22,441 width=16) (actual time=0.004..0.004 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: 1,024 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)