From: | Joe Conway <mail(at)joeconway(dot)com> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | pgsql-hackers(at)postgreSQL(dot)org |
Subject: | Re: Read-only plan trees |
Date: | 2002-12-02 01:13:01 |
Message-ID: | 3DEAB39D.8050704@joeconway.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers pgsql-patches |
Tom Lane wrote:
> Either of these approaches would mean that we couldn't easily "just
> execute" a scalar expression tree, which is something that we do in
> quite a few places (constraint checking for instance). There would need
> to be some advance setup done. With the Param-style approach, the
> advance setup would not be read-only on the expression plan tree ...
> which seems like a bad idea, so I'm leaning towards building the more
> expensive data structure.
Even though the former is a bit more expensive, it sounds like it is still a
net win due to reduced/eliminated need for making plan tree copies, right? It
sounds like it is also simpler and easier to maintain.
> Step 3: only after all the above spadework is done could we actually set
> up a query-lifetime memory context and build the executor's state in it.
>
> Comments?
Sounds like a great plan. Let me know if there's anything I can do to help.
Joe
From | Date | Subject | |
---|---|---|---|
Next Message | Paul Ramsey | 2002-12-02 01:36:53 | Re: Does anyone know what "embedded transactions" are? |
Previous Message | Tom Lane | 2002-12-02 00:21:04 | Read-only plan trees |
From | Date | Subject | |
---|---|---|---|
Next Message | Rod Taylor | 2002-12-02 01:36:09 | Re: contrib/adddepend does not properly re-create |
Previous Message | Tom Lane | 2002-12-02 00:22:29 | Re: contrib/adddepend does not properly re-create |