From: | "Christopher Kings-Lynne" <chriskl(at)familyhealth(dot)com(dot)au> |
---|---|
To: | "Joe Conway" <mail(at)joeconway(dot)com> |
Cc: | "pgsql-hackers" <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: Proposal: anonymous composite types for Table Functions (aka SRFs) |
Date: | 2002-07-25 07:16:14 |
Message-ID: | GNELIHDDFBOCMGBFGEFOKEFJCDAA.chriskl@familyhealth.com.au |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers pgsql-patches |
> The column names and types are determined in the parser, and used in the
> planner, optimizer, and executor. I'm not sure how the backend could
> plan a join or a where criteria otherwise.
>
> Remember that the function has to look just like a table or a subselect
> (i.e a RangeVar). With a table, the column names and types are
> predefined. With a subselect, parsing it yields the same information.
> With a table function, we need some way of providing it -- i.e. either
> with a predefined type, or now with a definition right in the FROM clause.
Or you could "parse" the function by retrieving the first row from the it
and assuming that that's the function definition?
Chris
From | Date | Subject | |
---|---|---|---|
Next Message | John Liu | 2002-07-25 13:55:53 | why? |
Previous Message | Zeugswetter Andreas SB SD | 2002-07-25 07:02:30 | Re: Proposal: anonymous composite types for Table Functions (aka SRFs) |
From | Date | Subject | |
---|---|---|---|
Next Message | John Liu | 2002-07-25 13:55:53 | why? |
Previous Message | Joe Conway | 2002-07-25 07:00:48 | Re: Proposal: anonymous composite types for Table Functions |