Через EXIST
Gather  (cost=1032884.17..6135845.84 rows=2913619 width=4) (actual time=62.897..5231.869 rows=184475 loops=1)
   Workers Planned: 4
   Workers Launched: 4
   Buffers: shared hit=1051138 read=27111
   I/O Timings: read=48.592
   ->  Hash Join  (cost=1031884.17..5843483.94 rows=728405 width=4) (actual time=67.164..4971.449 rows=36895 loops=5)
         Hash Cond: (t1.id_house = t2.id)
         Buffers: shared hit=1051138 read=27111
         I/O Timings: read=48.592
         ->  Parallel Seq Scan on cache_table t1  (cost=0.00..4713003.40 rows=37560484 width=8) (actual time=0.013..1943.587 rows=30048358 loops=5)
               Buffers: shared hit=935648 read=21307
               I/O Timings: read=30.423
         ->  Hash  (cost=933260.31..933260.31 rows=962184 width=4) (actual time=55.043..55.043 rows=71594 loops=5)
               Buckets: 1048576  Batches: 1  Memory Usage: 10709kB
               Buffers: shared hit=115322 read=5804
               I/O Timings: read=18.169
               ->  Index Scan using houses_index on houses t2  (cost=0.56..933260.31 rows=962184 width=4) (actual time=0.597..40.698 rows=71594 loops=5)
                     Index Cond: (id_addresses = ANY ('{13,17572575}'::integer[]))
                     Buffers: shared hit=115322 read=5804
                     I/O Timings: read=18.169
 Planning Time: 4.252 ms
 Execution Time: 5237.685 ms
(22 rows)


______________________________________________________
______________________________________________________
______________________________________________________
______________________________________________________
Черех иннер джоин


 Gather Merge  (cost=5915410.19..6264271.43 rows=2913620 width=4) (actual time=4929.216..5133.867 rows=184475 loops=1)
   Workers Planned: 4
   Workers Launched: 4
   Buffers: shared hit=1057130 read=21147
   I/O Timings: read=29.649
   ->  Sort  (cost=5914410.13..5916231.14 rows=728405 width=4) (actual time=4902.611..4905.086 rows=36895 loops=5)
         Sort Key: t1.index_id DESC
         Sort Method: quicksort  Memory: 3282kB
         Worker 0:  Sort Method: quicksort  Memory: 3241kB
         Worker 1:  Sort Method: quicksort  Memory: 3351kB
         Worker 2:  Sort Method: quicksort  Memory: 3139kB
         Worker 3:  Sort Method: quicksort  Memory: 3316kB
         Buffers: shared hit=1057130 read=21147
         I/O Timings: read=29.649
         ->  Hash Join  (cost=1031884.17..5843483.94 rows=728405 width=4) (actual time=63.729..4894.687 rows=36895 loops=5)
               Hash Cond: (t1.id_house = t2.id)
               Buffers: shared hit=1057102 read=21147
               I/O Timings: read=29.649
               ->  Parallel Seq Scan on cache_table t1  (cost=0.00..4713003.40 rows=37560484 width=8) (actual time=0.013..1904.929 rows=30048358 loops=5)
                     Buffers: shared hit=935808 read=21147
                     I/O Timings: read=29.649
               ->  Hash  (cost=933260.31..933260.31 rows=962184 width=4) (actual time=51.165..51.165 rows=71594 loops=5)
                     Buckets: 1048576  Batches: 1  Memory Usage: 10709kB
                     Buffers: shared hit=121126
                     ->  Index Scan using houses_index on houses t2  (cost=0.56..933260.31 rows=962184 width=4) (actual time=0.634..36.510 rows=71594 loops=5)
                           Index Cond: (id_addresses = ANY ('{13003575}'::integer[]))
                           Buffers: shared hit=121126
 Planning Time: 3.922 ms
 Execution Time: 5139.906 ms
(29 rows)