Re: A hierarchical query - how do I do

"oracle_doc" <nilendu_at_nilendu.com> a écrit dans le message de news: 1140255476.221077.203740_at_f14g2000cwb.googlegroups.com...

| Actually, in the above example, I was wrong. The sorting on ID -
| PARENT_ID should happen in the reverse order,
|
| i.e.,
| (1)     children before parents (TASKS table)
| (2)     predecessors before successors  (TASK_PREDECESSORS table)
|
| So, the final dataset should look like -
|
| {b c a A}
|
| Is this doable through a single SQL?
|

I don't understand your example:
- c (5) is precedessor of b (3), so shouldn't this be { c b ... }?

• a (2) is also predecessor of b (3), so shouldn't it be displayed before b?
• how do you handle multiple predecessors/successors?
• is this possible?
• is this possible to have the same id in different parts of your graph?
• what is the wanted result with many parents?
• ...

Finally, can you post a complete (and consistent) example?

Regards
Michel Cadot Received on Sat Feb 18 2006 - 03:56:10 CST