Re: Recognizing range constraints (was Re: Plan for relatively simple query seems to be very inefficient) - Mailing list pgsql-performance

From Tom Lane
Subject Re: Recognizing range constraints (was Re: Plan for relatively simple query seems to be very inefficient)
Date
Msg-id 23152.1112918336@sss.pgh.pa.us
Whole thread Raw
In response to Re: Recognizing range constraints (was Re: Plan for relatively simple query seems to be very inefficient)  (Mischa <mischa.Sandberg@telus.net>)
Responses Re: Recognizing range constraints (was Re: Plan for relatively simple query seems to be very inefficient)  (a3a18850@telus.net)
List pgsql-performance
Mischa <mischa.Sandberg@telus.net> writes:
> Quoting Tom Lane <tgl@sss.pgh.pa.us>:
>> WHERE a.x > b.y AND a.x < 42

> Out of curiosity, will the planner induce "b.y < 42" out of this?

No.  There's some smarts about transitive equality, but none about
transitive inequalities.  Offhand I'm not sure if it'd be useful to add
such.  The transitive-equality code pulls its weight because you so
often have situations like

    create view v as select a.x, ... from a join b on (a.x = b.y);

    select * from v where x = 42;

but I'm less able to think of common use-cases for transitive
inequality ...

            regards, tom lane

pgsql-performance by date:

Previous
From: "Jim C. Nasby"
Date:
Subject: Re: [HACKERS] Recognizing range constraints (was Re: Plan for relatively simple query seems to be very inefficient)
Next
From: "Greg Sabino Mullane"
Date:
Subject: Re: help on explain analyse in psql 7.1.3 (linux)