|
|
Posted by Steve on 06/06/07 18:59
On 6 Jun, 19:16, gosha bine <stereof...@gmail.com> wrote:
> Doesn't this article also explain why you should NOT use adjacency
> lists? With recursive queries you're doing N selects to fetch N
> elements, that makes using database essentially pointless. From my
> experience, ALs are only suitable for very small sets, which can be read
> once completely and then processed in memory.
>
Hi there. Yes it does - and recommends the "Modified Preorder Tree
Traversal" method.
I couldn't get this to work when the tree has several starting nodes
as mine does.
Would welcome any hints about finding a solution to this and producing
a HTML structured list from the results.
Best regards.
Steve
Navigation:
[Reply to this message]
|