|
|
Posted by mootmail-googlegroups on 09/01/06 20:29
Jerry Stuckle wrote:
>
> If you can do recursive queries, it works quite well. And this was with
> DB2, which handles recursive queries quite well.
>
Hmm. The DB we were using didn't support recursive queries, so I never
got to explore that path, unfortunately. I suspect that, as you say,
it would handle well enough performance-wise, seeing that all the
recursing is done on the DB itself rather than via recursive queries
coming from the code. Still, though, even the most efficient recursion
carries along with it some degree of overhead. That's just the nature
of recursion.
If I had the time spare time, I would love to implement a number of
tree algorithms and see how they scale in performance as the size of
the tree increases. That is the kind of assignment I WISH they had
given back in college. Practical and educational.
Navigation:
[Reply to this message]
|