Adrian von Bidder wrote:
> Hi,
>
> Is there any way to do tree traversal with only one SQL query (no
> procedure/function)?
>
> CREATE TABLE foo (
> node INTEGER,
> parent INTEGER REFERENCES foo(node)
> );
>
> Ideally the output would be a depth-first tree traversal starting at root
> (marked by parent == node, for example.)
>
> Obviously, I can do this with "normal" programming and loops, but it bugged
> me a while if its at all possible doing this in one query.
Have a look at contrib/ltree ;)
--
Alban Hertroys
[EMAIL PROTECTED]
magproductions b.v.
T: ++31(0)534346874
F: ++31(0)534346876
M:
I: www.magproductions.nl
A: Postbus 416
7500 AK Enschede
// Integrate Your World //
---------------------------(end of broadcast)---------------------------
TIP 3: Have you checked our extensive FAQ?
http://www.postgresql.org/docs/faq
