Received: from bubbles.electricutopia.net (bubbles.electricutopia.net [63.214.178.76]) by mail.postgresql.org (8.11.1/8.11.1) with ESMTP id f22Knbx81103 for ; Fri, 2 Mar 2001 15:49:37 -0500 (EST) (envelope-from dave@slickness.org) Received: from localhost (dave@localhost) by bubbles.electricutopia.net (8.9.3/8.9.3) with ESMTP id MAA19077; Fri, 2 Mar 2001 12:48:09 -0800 Date: Fri, 2 Mar 2001 12:48:09 -0800 (PST) From: David Olbersen X-X-Sender: To: Gerald Gutierrez cc: Subject: Re: Temp Tables & Connection Pooling In-Reply-To: <5.0.2.1.0.20010302103136.02a1a388@mail.rchmd1.bc.wave.home.com> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Archive-Number: 200103/32 X-Sequence-Number: 1677 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 connection pooling make it unusable since the table ->might "disappear" from one query to the next? What are alternative ->approaches to implementing Dijkstra's algorithm inside the database? Wouldn't a VIEW do what you want? -- Dave