| From: | Rod Taylor <rbt(at)rbt(dot)ca> |
|---|---|
| To: | Benoît Bournon <benoit(dot)bournon(at)adelis(dot)com> |
| Cc: | pgsql-sql(at)postgresql(dot)org |
| Subject: | Re: Recursive request ... |
| Date: | 2003-07-10 13:32:00 |
| Message-ID: | 1057843920.46100.123.camel@jester |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-sql |
On Wed, 2003-07-09 at 15:27, Benoît Bournon wrote:
> I have to make a function that returns a tree with title and link of a
> table.
>
> Recursively, a information depends on a parent information.
>
> It is to organise a menu with parent dependance.
>
> How is it possible and faster ? in C ? pl/pgsql or other ?
If your only concern is speed, go with a C function. This (however) can
make backing up / restoring the database to a different machine a little
bit cumbersome. You need to be sure to install the modules on the other
box manually prior to restoring the database itself.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Rod Taylor | 2003-07-10 13:43:06 | Re: substr_count |
| Previous Message | Michael Pohl | 2003-07-10 12:55:59 | Re: substr_count |