Re: review: Non-recursive processing of AND/OR lists

From: Josh Berkus <josh(at)agliodbs(dot)com>
To: Robert Haas <robertmhaas(at)gmail(dot)com>
Cc: Pavel Stehule <pavel(dot)stehule(at)gmail(dot)com>, Gurjeet Singh <gurjeet(at)singh(dot)im>, PostgreSQL Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: review: Non-recursive processing of AND/OR lists
Date: 2013-07-11 01:02:00
Message-ID: 51DE0408.6020008@agliodbs.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers


> 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?

--
Josh Berkus
PostgreSQL Experts Inc.
http://pgexperts.com

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Josh Berkus 2013-07-11 01:04:46 Re: [PATCH] Remove useless USE_PGXS support in contrib
Previous Message Josh Berkus 2013-07-11 00:58:17 Re: Bugfix and new feature for PGXS