EXPLAIN
A more interesting query
QUERY PLAN
------------------------------------------------------------------------------------------------------------------------------------
Sort (cost=35.84..35.93 rows=37 width=4)
Sort Key: "*SELECT* 1".message_date
-> HashSetOp Intersect (cost=11.17..34.87 rows=37 width=4)
-> Append (cost=11.17..34.69 rows=74 width=4)
-> Subquery Scan on "*SELECT* 1" (cost=11.17..17.34 rows=37 width=4)
-> Hash Join (cost=11.17..16.97 rows=37 width=4)
Hash Cond: (m.message_id = r.message_id)
-> Seq Scan on message m (cost=0.00..4.50 rows=250 width=8)
-> Hash (cost=10.70..10.70 rows=37 width=4)
-> Nested Loop (cost=4.58..10.70 rows=37 width=4)
-> Seq Scan on member f (cost=0.00..1.25 rows=1 width=4)
Filter: ((name)::text = 'Unguiferous'::text)
-> Bitmap Heap Scan on routing r (cost=4.58..9.06 rows=39 width=8)
Recheck Cond: (from_member_id = f.member_id)
-> Bitmap Index Scan on routing_from_member_id_idx (cost=0.00..4.57 rows=39 width=0)
Index Cond: (from_member_id = f.member_id)
-> Subquery Scan on "*SELECT* 2" (cost=11.17..17.34 rows=37 width=4)
-> Hash Join (cost=11.17..16.97 rows=37 width=4)
Hash Cond: (m_1.message_id = r_1.message_id)
-> Seq Scan on message m_1 (cost=0.00..4.50 rows=250 width=8)
-> Hash (cost=10.70..10.70 rows=37 width=4)
-> Nested Loop (cost=4.58..10.70 rows=37 width=4)
-> Seq Scan on member f_1 (cost=0.00..1.25 rows=1 width=4)
Filter: ((name)::text = 'Abderian'::text)
-> Bitmap Heap Scan on routing r_1 (cost=4.58..9.06 rows=39 width=8)
Recheck Cond: (from_member_id = f_1.member_id)
-> Bitmap Index Scan on routing_from_member_id_idx (cost=0.00..4.57 rows=39 width=0)
Index Cond: (from_member_id = f_1.member_id)
(28 rows)
|