Re: [HACKERS] Boom filters for hash joins (was: A design for amcheckheapam verification) - Mailing list pgsql-hackers

From Robert Haas
Subject Re: [HACKERS] Boom filters for hash joins (was: A design for amcheckheapam verification)
Date
Msg-id CA+TgmoYKT64JYN6E9Kfb3PRKwuP0ORY1CJDU3ibBuYBsHjcCqA@mail.gmail.com
Whole thread Raw
In response to Re: [HACKERS] Boom filters for hash joins (was: A design for amcheck heapam verification)  (Tom Lane <tgl@sss.pgh.pa.us>)
Responses Re: [HACKERS] Boom filters for hash joins (was: A design for amcheckheapam verification)
List pgsql-hackers
On Mon, Sep 18, 2017 at 1:29 PM, Tom Lane <tgl@sss.pgh.pa.us> wrote:
> Uh, why does the planner need to be involved at all?

Because it loses if the Bloom filter fails to filter anything.  That's
not at all far-fetched; consider SELECT * FROM a.x, b.x WHERE a.x =
b.x given a foreign key on a.x referencing b(x).

-- 
Robert Haas
EnterpriseDB: http://www.enterprisedb.com
The Enterprise PostgreSQL Company


-- 
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers

pgsql-hackers by date:

Previous
From: Robert Haas
Date:
Subject: Re: [HACKERS] Partition-wise join for join between (declaratively)partitioned tables
Next
From: Peter Geoghegan
Date:
Subject: Re: [HACKERS] Boom filters for hash joins (was: A design for amcheckheapam verification)