Re: Recursive request ...

Thx a lot, I know now that it is possible to do that with pure sql.

Have you the alogorythm, because your link is dead ?

Ben

Rajesh Kumar Mallah a écrit:

>Dear Bournon,
>
>There are already good implementation of Tree
>structures in databases ranging from using pure SQL
>to PostgreSQL specfic methods , less point in
>revinting wheel unless u really need.
>
>Some Pointers:
>
>"Tree-structure functions"
>http://www.brasileiro.net:8080/postgres/cookbook/
>
>
>Gist Based:
>contrib/ltree
>
>
>Joe Celko's Article on "Nested Sets & Adjacency Lists"
>
>http://www.ibase.ru/devinfo/DBMSTrees/sqltrees.html
>http://users.starpower.net/rjhalljr/Serve/MySQL/traer.html
>http://www.google.com/search?hl=en&ie=UTF-8&oe=UTF-8&q=adjacency+list+%2B+tree+%2B+joe
>
>
>
>On Wednesday 09 Jul 2003 8:57 pm, 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 ?
>>
>>
>>---------------------------(end of broadcast)---------------------------
>>TIP 4: Don't 'kill -9' the postmaster
>>
>>
>
>
>---------------------------(end of broadcast)---------------------------
>TIP 4: Don't 'kill -9' the postmaster
>
>
>