| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | Robert Haas <robertmhaas(at)gmail(dot)com> |
| Cc: | Marko Tiikkaja <marko(dot)tiikkaja(at)cs(dot)helsinki(dot)fi>, PostgreSQL hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Using results from INSERT ... RETURNING |
| Date: | 2009-09-27 04:40:11 |
| Message-ID: | 15963.1254026411@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Robert Haas <robertmhaas(at)gmail(dot)com> writes:
> Well, part of the problem is that I've not had a lot of luck trying to
> understand how the executor really works (what's a tuple table slot
> and why do we need to know in advance how many of them there are?).
You know, that's actually a really good question. There is not, as far
as I can see, much advantage to keeping the Slots in an array. We could
perfectly well keep them in a List and eliminate the notational overhead
of having to count them in advance. There'd be a bit more palloc
overhead (for the list cells) but avoiding the counting work would more
or less make up for that.
regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Heikki Linnakangas | 2009-09-27 10:57:38 | Re: Hot Standby on git |
| Previous Message | Pavel Stehule | 2009-09-27 04:37:03 | Re: Issues for named/mixed function notation patch |