| From: | Andres Freund <andres(at)anarazel(dot)de> |
|---|---|
| To: | Robert Haas <robertmhaas(at)gmail(dot)com> |
| Cc: | Andrew Dunstan <andrew(at)dunslane(dot)net>, Greg Stark <gsstark(at)mit(dot)edu>, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: machine-readable explain output |
| Date: | 2009-06-16 14:59:06 |
| Message-ID: | 4A37B33A.6070606@anarazel.de |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Hi,
On 06/16/2009 04:32 PM, Robert Haas wrote:
> On Tue, Jun 16, 2009 at 10:30 AM, Andres Freund<andres(at)anarazel(dot)de> wrote:
>> How would you model something like:
>> <plans>
>> <plan> ...</plan>
>> <plan> ...</plan>
>> ...
>> </plans>
>> otherwise?
>>
>> There are potentially unlimited number of child nodes - AppendNode for
>> example can have any number of them. Sure, you can give each<plan> node a
>> 'offset=' id, but that doesn't buy much.
>> I don't see how that could be much improved by using child-nodes (or even
>> worse attributes).
> Note that even in this case we DON'T rely on the ordering of the
> nodes. The inner<plan> nodes have child nodes which contain their
> relationship to the parent.
Not in the case of Append nodes, but I fail to see a problem there, so...
Andres
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Andrew Dunstan | 2009-06-16 14:59:32 | Re: machine-readable explain output |
| Previous Message | Jeremy Kerr | 2009-06-16 14:53:35 | Re: [PATCH] backend: compare word-at-a-time in bcTruelen |