2025-03-24 09:26:31.632
5e9c072f78130c99a7bb60b53955dc10
 1.097 ms
tilemap |  piechart
timetilemap
#
node, ms
tree, ms
rows
RRbF
loops
node
35973.699110321
итоговые результаты
0
.005
35973.699
1
Limit
1
  CTE r
2
681.049
1865.506
4162080
   ->  Recursive Union
3
5.868
2080
        ->  Function Scan on regexp_matches t_2
4
1178.589
4160079
2001
0.0%
2001
        ->  WorkTable Scan on r r_1
5
7.741
35973.694
1
  ->  Sort
6
1212.959
35965.953
40951
       ->  GroupAggregate
7
719.460
34752.994
4016720
            ->  Unique
8
19651.363
34033.534
4153760
                 ->  Sort
9
637.674
14382.171
4153760
8320
0.2%
                      ->  Subquery Scan on t
10
5187.772
13744.497
4162080
                           ->  WindowAgg
11
400.926
8556.725
4162080
                                ->  Subquery Scan on t_1
12
2356.939
8155.799
4162080
                                     ->  WindowAgg
13
2890.495
5798.860
4162080
                                          ->  Sort
14
1042.859
2908.365
4162080
                                               ->  CTE Scan on r
.296
 
Planning Time
99.570
36073.269
Execution Time
Limit (actual time=35973.692..35973.699 rows=1 loops=1)
  CTE r
    ->  Recursive Union (actual time=5.433..1865.506 rows=4162080 loops=1)
          ->  Function Scan on regexp_matches t_2 (actual time=5.432..5.868 rows=2080 loops=1)
          ->  WorkTable Scan on r r_1 (actual time=0.001..0.589 rows=2079 loops=2001)
                Filter: (i < 2000)
                Rows Removed by Filter: 1
  ->  Sort (actual time=35973.691..35973.694 rows=1 loops=1)
        Sort Key: (sum(t.price)) DESC
        Sort Method: top-N heapsort  Memory: 25kB
        ->  GroupAggregate (actual time=32714.284..35965.953 rows=40951 loops=1)
              Group Key: t.seq
              ->  Unique (actual time=32714.241..34752.994 rows=4016720 loops=1)
                    ->  Sort (actual time=32714.240..34033.534 rows=4153760 loops=1)
                          Sort Key: t.seq, t.id, t.i
                          Sort Method: external merge  Disk: 256064kB
                          ->  Subquery Scan on t (actual time=5241.586..14382.171 rows=4153760 loops=1)
                                Filter: (t.seq[1] IS NOT NULL)
                                Rows Removed by Filter: 8320
                                ->  WindowAgg (actual time=5241.561..13744.497 rows=4162080 loops=1)
                                      ->  Subquery Scan on t_1 (actual time=5241.512..8556.725 rows=4162080 loops=1)
                                            ->  WindowAgg (actual time=5241.511..8155.799 rows=4162080 loops=1)
                                                  ->  Sort (actual time=5241.497..5798.860 rows=4162080 loops=1)
                                                        Sort Key: r.id, r.i
                                                        Sort Method: quicksort  Memory: 260886kB
                                                        ->  CTE Scan on r (actual time=5.434..2908.365 rows=4162080 loops=1)
Planning Time: 0.296 ms
Execution Time: 36073.269 ms
      
время % rows RRbF % loops тип узла таблица индекс узлы
22549.599
62.7
8315841
3
Sort
5 8 13
3
7544.711
21.0
8324160
2
WindowAgg
10 12
2
1212.959
3.4
40951
GroupAggregate
6
1178.589
3.3
4160079
2001
.0
2001
WorkTable Scan
r
4
1042.859
2.9
4162080
CTE Scan
r
14
719.460
2.0
4016720
Unique
7
681.049
1.9
4162080
Recursive Union
2
637.674
1.8
4153760
8320
.2
Subquery Scan
t
9
400.926
1.1
4162080
Subquery Scan
t_1
11
5.868
0.0
2080
Function Scan
regexp_matches
3
.005
0.0
1
Limit
0
tooltip