From: | Peter Eisentraut <peter_e(at)gmx(dot)net> |
---|---|
To: | pgsql-interfaces(at)postgresql(dot)org |
Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Scott Lamb <slamb(at)slamb(dot)org> |
Subject: | Re: Incremental results from libpq |
Date: | 2005-11-16 09:34:58 |
Message-ID: | 200511161034.58561.peter_e@gmx.net |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-interfaces |
Am Mittwoch, 9. November 2005 22:22 schrieb Tom Lane:
> The main reason why libpq does what it does is that this way we do not
> have to expose in the API the notion of a command that fails part way
> through.
I'm at LinuxWorld Frankfurt and one of the Trolltech guys came over to talk to
me about this. He opined that it would be beneficial for their purpose (in
certain cases) if the server would first compute the entire result set and
keep it in the server memory (thus eliminating potential errors of the 1/x
kind) and then ship it to the client in a way that the client would be able
to fetch it piecewise. Then, the client application could build the display
incrementally while the rest of the result set travels over the (slow) link.
Does that make sense?
From | Date | Subject | |
---|---|---|---|
Next Message | Magnus Hagander | 2005-11-16 09:57:15 | Re: Incremental results from libpq |
Previous Message | Goulet, Dick | 2005-11-13 16:23:18 | Re: Incremental results from libpq |