Re: review: Non-recursive processing of AND/OR lists - Mailing list pgsql-hackers

From Robert Haas
Subject Re: review: Non-recursive processing of AND/OR lists
Date
Msg-id CA+Tgmobk9wTF7k3aYJ9_5Z_sqJOjNSNfNu5vWGvDe8gz63gdfg@mail.gmail.com
Whole thread Raw
In response to Re: review: Non-recursive processing of AND/OR lists  (Josh Berkus <josh@agliodbs.com>)
Responses Re: review: Non-recursive processing of AND/OR lists
List pgsql-hackers
On Wed, Jul 10, 2013 at 9:02 PM, Josh Berkus <josh@agliodbs.com> wrote:
>> I think it's a waste of code to try to handle bushy trees.  A list is
>> not a particularly efficient representation of the pending list; this
>> will probably be slower than recusing in the common case.  I'd suggest
>> keeping the logic to handle left-deep trees, which I find rather
>> elegant, but ditching the pending list.
>
> Is there going to be further discussion of this patch, or do I return it?

Considering it's not been updated, nor my comments responded to, in
almost two weeks, I think we return it at this point.

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



pgsql-hackers by date:

Previous
From: Robert Haas
Date:
Subject: Re: pg_memory_barrier() doesn't compile, let alone work, for me
Next
From: Noah Misch
Date:
Subject: Re: FILTER for aggregates [was Re: Department of Redundancy Department: makeNode(FuncCall) division]