Received: from mail1.rdc2.bc.home.com (mail1.rdc2.bc.home.com [24.2.10.84]) by mail.postgresql.org (8.11.1/8.11.1) with ESMTP id f22IbVx65303 for ; Fri, 2 Mar 2001 13:37:31 -0500 (EST) (envelope-from pozix@home.com) Received: from elrond.home.com ([24.113.128.171]) by mail1.rdc2.bc.home.com (InterMail vM.4.01.03.00 201-229-121) with ESMTP id <20010302183730.NBGE25888.mail1.rdc2.bc.home.com@elrond.home.com> for ; Fri, 2 Mar 2001 10:37:30 -0800 Message-Id: <5.0.2.1.0.20010302103136.02a1a388@mail.rchmd1.bc.wave.home.com> X-Sender: pozix@mail.rchmd1.bc.wave.home.com X-Mailer: QUALCOMM Windows Eudora Version 5.0.2 Date: Fri, 02 Mar 2001 10:40:00 -0800 To: pgsql-sql@postgresql.org From: Gerald Gutierrez Subject: Temp Tables & Connection Pooling Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii"; format=flowed X-Archive-Number: 200103/31 X-Sequence-Number: 1676 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 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? I'd appreciate any insights. Gerald.