From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | olly(at)lfix(dot)co(dot)uk |
Cc: | Andrew Hall <temp02(at)bluereef(dot)com(dot)au>, pgsql-general(at)postgresql(dot)org |
Subject: | Re: Stored Procedures woes |
Date: | 2004-08-19 14:35:57 |
Message-ID: | 15681.1092926157@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
Oliver Elphick <olly(at)lfix(dot)co(dot)uk> writes:
>> We are using a number of stored procedures that are called often from our
>> client programs.
> Are you somehow setting off an infinite recursion? How is this being
> called?
I doubt it would be an infinite-recursion problem, as that would soon
lead to stack overflow and core dump (or at least very obvious memory
bloat). I'm wondering about inefficient plans being generated for the
queries in the procedure.
> Try putting RAISE NOTICE statements in to track the progress of the
> code.
Right. See also recent discussion on pgsql-performance about
investigating plans used for plpgsql queries.
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Oleg Bartunov | 2004-08-19 14:44:42 | Re: Finally tsearch works ... somehow... remain a few |
Previous Message | Tom Lane | 2004-08-19 14:32:53 | Re: possible bug in exception handling code? (postgres8.0beta) |