From: | Anton(dot)Nikiforov(at)loteco(dot)ru |
---|---|
To: | pgsql-general(at)postgresql(dot)org |
Subject: | Hierarchical queries |
Date: | 2004-01-09 19:05:06 |
Message-ID: | 16314523754.20040109220506@loteco.ru |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
Hello everybody!
Does someone know how to build hierarchical queries to the postgresql?
I have a table with tree in it (id, parent)
and need to find a way from any point of the tree to any other point.
And i would like to have a list of all steps from point A to point B
to make some changes on each step (this is required by the algorythm).
Here is an example:
treetable (where tree is stored):
id parent data
int4 int4 varchar(255)
0 0 root
1 0 root's chield 1
2 0 root's chield 2
3 1 root's chield 1 chield 1
4 1 root's chield 1 chield 2
5 2 root's chield 2 chield 1
6 2 root's chield 2 chield 2
And i want to get something like this:
start point "root's chield 2 chield 2"
finish "root's chield 1 chield 1"
And the result i need:
id parent data
6 2 root's chield 2 chield 2
2 0 root's chield 2
0 0 root
1 0 root's chield 1
4 1 root's chield 1 chield 2
i know that it is possible in Oracle but what about postgres?
Best regards,
Anton Nikiforov
From | Date | Subject | |
---|---|---|---|
Next Message | Andrew Rawnsley | 2004-01-09 19:16:14 | Re: Hierarchical queries |
Previous Message | Teodor Sigaev | 2004-01-09 17:54:33 | Re: TSearch2 ... ignore word repetition for rank |