Joe Conway <[EMAIL PROTECTED]> writes:
>> Any ideas about naming are welcome.
> Maybe:
> Plan steps Expressions
> -
> Planner output"Plan" "Expr"
> Executor state
Tom Lane wrote:
Right at the moment I'm struggling a bit with terminology. We've got
basically four categories of node types to deal with in this scheme:
Plan steps Expressions
(Scan, Sort, etc) (Var, Op, Func, etc)
Planner output "Plan" "Expr"?
Executor state "CommonState" ???
Th
Joe Conway <[EMAIL PROTECTED]> writes:
> 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 se
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
advanc
