Gerald Gutierrez wrote:
At 12:48 PM 3/2/2001 -0800, David Olbersen wrote:
On Fri, 2 Mar 2001, Gerald Gutierrez wrote:
-Recently I wanted to implement Dijkstra's algorithm as a stored procedure,
-and finding that PL/PGSQL cannot return record sets, I thought about using
-a temporary table
David Olbersen wrote:
On Fri, 2 Mar 2001, Gerald Gutierrez wrote:
-Recently I wanted to implement Dijkstra's algorithm as a stored procedure,
-and finding that PL/PGSQL cannot return record sets, I thought about using
-a temporary table for the results. If tempoary tables are
At 12:48 PM 3/2/2001 -0800, David Olbersen wrote:
On Fri, 2 Mar 2001, Gerald Gutierrez wrote:
-Recently I wanted to implement Dijkstra's algorithm as a stored procedure,
-and finding that PL/PGSQL cannot return record sets, I thought about using
-a temporary table for the results. If tempoary
I use PostgreSQL via a connection pooling mechanism, whether it be J2EE or
PHP. I've been able to achieve good performance this way, and it has been
good to me.
Recently I wanted to implement Dijkstra's algorithm as a stored procedure,
and finding that PL/PGSQL cannot return record sets, I
On Fri, 2 Mar 2001, Gerald Gutierrez wrote:
-Recently I wanted to implement Dijkstra's algorithm as a stored procedure,
-and finding that PL/PGSQL cannot return record sets, I thought about using
-a temporary table for the results. If tempoary tables are session-specific,
-however, then wouldn't
