2022-03-29 09:53:20.631
350c3340f570e9febe8d32328ccc21b0
 1.274 ms
CC#4
#2 BHS |
#5 BHS |
tilemap |  piechart
time | bufferstilemap
#
node, ms
tree, ms
rows
Merge JoinSortBitmap Heap Scan on tst_eav r1Bitmap Index Scan on eav_idx1SortBitmap Heap Scan on tst_eav r2Bitmap Index Scan on eav_idx1
sh.ht
.4321
итоговые результаты
207
0
.020
.432
1
Merge Join
1
.029
.235
98
  ->  Sort
2
.177
.206
98
       ->  Bitmap Heap Scan on tst_eav r1
97
3
.029
98
            ->  Bitmap Index Scan on eav_idx1
3
4
.025
.177
104
CC
  ->  Sort
5
.140
.152
104
       ->  Bitmap Heap Scan on tst_eav r2
104
6
.012
104
            ->  Bitmap Index Scan on eav_idx1
3
.225
 
Planning Time
.069
.501
Execution Time
по затраченному времени | по использованию данныхeav_idx1eav_idx1eav_idx1eav_idx1tst_eav r1tst_eav r1tst_eav r2tst_eav r2SortSortSortSortMerge JoinMerge Join
Merge Join (actual time=0.408..0.432 rows=1 loops=1)
  Merge Cond: (r1.e = r2.e)
  Buffers: shared hit=207
  ->  Sort (actual time=0.231..0.235 rows=98 loops=1)
        Sort Key: r1.e
        Sort Method: quicksort  Memory: 29kB
        Buffers: shared hit=100
        ->  Bitmap Heap Scan on tst_eav r1 (actual time=0.049..0.206 rows=98 loops=1)
              Recheck Cond: ((a = 1) AND (v = 1))
              Heap Blocks: exact=97
              Buffers: shared hit=100
              ->  Bitmap Index Scan on eav_idx1 (actual time=0.029..0.029 rows=98 loops=1)
                    Index Cond: ((a = 1) AND (v = 1))
                    Buffers: shared hit=3
  ->  Sort (actual time=0.172..0.177 rows=104 loops=1)
        Sort Key: r2.e
        Sort Method: quicksort  Memory: 29kB
        Buffers: shared hit=107
        ->  Bitmap Heap Scan on tst_eav r2 (actual time=0.022..0.152 rows=104 loops=1)
              Recheck Cond: ((a = 2) AND (v = 2))
              Heap Blocks: exact=104
              Buffers: shared hit=107
              ->  Bitmap Index Scan on eav_idx1 (actual time=0.012..0.012 rows=104 loops=1)
                    Index Cond: ((a = 2) AND (v = 2))
                    Buffers: shared hit=3
Planning Time: 0.225 ms
Execution Time: 0.501 ms
Join
  ->  Scan Table tst_eav
  ->  Scan Table tst_eav
"Merge Join (actual time=0.408..0.432 rows=1 loops=1)"
"  Merge Cond: (r1.e = r2.e)"
"  Buffers: shared hit=207"
"  ->  Sort (actual time=0.231..0.235 rows=98 loops=1)"
"        Sort Key: r1.e"
"        Sort Method: quicksort  Memory: 29kB"
"        Buffers: shared hit=100"
"        ->  Bitmap Heap Scan on tst_eav r1 (actual time=0.049..0.206 rows=98 loops=1)"
"              Recheck Cond: ((a = 1) AND (v = 1))"
"              Heap Blocks: exact=97"
"              Buffers: shared hit=100"
"              ->  Bitmap Index Scan on eav_idx1 (actual time=0.029..0.029 rows=98 loops=1)"
"                    Index Cond: ((a = 1) AND (v = 1))"
"                    Buffers: shared hit=3"
"  ->  Sort (actual time=0.172..0.177 rows=104 loops=1)"
"        Sort Key: r2.e"
"        Sort Method: quicksort  Memory: 29kB"
"        Buffers: shared hit=107"
"        ->  Bitmap Heap Scan on tst_eav r2 (actual time=0.022..0.152 rows=104 loops=1)"
"              Recheck Cond: ((a = 2) AND (v = 2))"
"              Heap Blocks: exact=104"
"              Buffers: shared hit=107"
"              ->  Bitmap Index Scan on eav_idx1 (actual time=0.012..0.012 rows=104 loops=1)"
"                    Index Cond: ((a = 2) AND (v = 2))"
"                    Buffers: shared hit=3"
"Planning Time: 0.225 ms"
"Execution Time: 0.501 ms"
# 4 Sort CC
Execution0.025ms5.8%: rows=104, loops=1
Sort (actual time=0.172..0.177 rows=104 loops=1)
  Sort Key: r2.e
  Sort Method: quicksort  Memory: 29kB
  Buffers: shared hit=107
CC
->  Sort
    node #1
    ->  Bitmap Heap Scan on tst_eav r2
        node #2
        ->  Bitmap Index Scan on eav_idx1
            node #3
Рекомендации [подробнее]:
- устраните повторное выполнение одинакового кода с помощью сохранения результата или совместного вычисления значений
Рекомендации :
- устраните повторное выполнение одинакового кода с помощью сохранения результата или совместного вычисления значений
#4
->  Sort
    node #1
    ->  Bitmap Heap Scan on tst_eav r2
        node #2
        ->  Bitmap Index Scan on eav_idx1
            node #3
время % rows loops тип узла таблица индекс узлы sh.ht
.317
73.4
202
2
Bitmap Heap Scan
tst_eav
2 5
2
201
.054
12.5
202
2
Sort
1 4
2
.041
9.5
202
2
Bitmap Index Scan
tst_eav
eav_idx1
3 6
2
6
.020
4.6
1
Merge Join
0
tooltip