Advertisement
daniilak

Untitled

Jun 4th, 2021
157
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1.  Gather Merge  (cost=2833738.23..3198674.18 rows=3127804 width=4) (actual time=7320.493..7349.905 rows=184475 loops=1)
  2.    Workers Planned: 2
  3.    Workers Launched: 2
  4.    Buffers: shared hit=60764 read=968966
  5.    ->  Sort  (cost=2832738.21..2836647.96 rows=1563902 width=4) (actual time=7313.369..7317.147 rows=61492 loops=3)
  6.          Sort Key: t1.index_id DESC
  7.          Sort Method: quicksort  Memory: 4424kB
  8.          Worker 0:  Sort Method: quicksort  Memory: 4337kB
  9.          Worker 1:  Sort Method: quicksort  Memory: 4496kB
  10.          Buffers: shared hit=60764 read=968966
  11.          ->  Hash Join  (cost=924548.91..2671838.35 rows=1563902 width=4) (actual time=288.015..7301.836 rows=61492 loops=3)
  12.                Hash Cond: (t1.id_house = t2.id)
  13.                Buffers: shared hit=60750 read=968966
  14.                ->  Parallel Seq Scan on cache_table t1  (cost=0.00..1582962.47 rows=62600747 width=8) (actual time=0.021..2876.967 rows=50080597 loops=3)
  15.                      Buffers: shared hit=4 read=956951
  16.                ->  Hash  (cost=909020.31..909020.31 rows=1242288 width=4) (actual time=273.413..273.414 rows=71594 loops=3)
  17.                      Buckets: 2097152  Batches: 1  Memory Usage: 18901kB
  18.                      Buffers: shared hit=60662 read=12015
  19.                      ->  Index Scan using houses_index on houses t2  (cost=0.56..909020.31 rows=1242288 width=4) (actual time=0.915..255.822 rows=71594 loops=3)
  20.                            Index Cond: (id_addresses = ANY ('{1300337,ПЕРЕЧИСЛЕНИЕ,17572575}'::integer[]))
  21.                            Buffers: shared hit=60662 read=12015
  22.  Planning Time: 8.329 ms
  23.  Execution Time: 7355.690 ms
  24. (23 rows)
  25.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement