On Mon, Aug 1, 2011 at 11:04 AM, David Fetter <david(at)fetter(dot)org> wrote:
> SQL is Turing-complete, so the chances are excellent that it's
> possible to express that algorithm in it. ;)
> Look into common table expressions for iteration/recursion, and
> windowing functions, commonly used for time series.
That doesn't guarantee that it can be expressed efficiently, though.
I think the OP may be going overboard by trying to bypass SPI, but
putting the logic inside the server seems like it could well be
The Enterprise PostgreSQL Company
In response to
pgsql-hackers by date
|Next:||From: Jeff Davis||Date: 2011-08-01 15:21:19|
|Subject: Re: lazy vxid locks, v3|
|Previous:||From: David Fetter||Date: 2011-08-01 15:04:58|
|Subject: Re: Access to current database from C-language function|