If you consider the approach using multiple trees, it may have quite a good
performance even for something like a threaded message board, if you think
of each thread as a different tree. Then trees are not enormous, and so
updates would not be so slow.
Performance will be poor, however, when updating very large trees.
Antonio Fiol
Micah Yoder wrote:
> > This approach will be two to three orders of magnitude faster than the
> > adjacency list model for subtree and aggregate operations.
>
> That's great, thanks for posting that!
>
> I take it this would NOT work well on things that are updated often, like
> threaded Net message boards with hundreds of thousands of messages...
>
> ---------------------------(end of broadcast)---------------------------
> TIP 6: Have you searched our list archives?
>
> http://archives.postgresql.org
