> 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...
