"Neo" <neo55592_at_hotmail.com> wrote in message
news:4b45d3ad.0403030710.7e2fd86c_at_posting.google.com...
> PS. I am still awaiting your solution to the problem posted in the
> "object algebra" thread.
0. Create hierarchy table with any known SQL-based method.
1. Select path to the root from node A ("Ancestors list" query).
2. Select path to the root from B.
3. Intersect 1 and 2.
4. Find the node most distant from the root in the result. (Hint: the node
is the most distant if there is no node closer. Duh!)
Which of the steps 0-4 you don't quite understand? Do you want me to spell
out *all* these steps?
Received on Wed Mar 03 2004 - 11:26:50 CST
