Universal Tree

The Universal Tree (UT) means the tree of persistent objects in a working set.

The tree is universal in the sense that the root node (called the UTRoot) has the same identity in all working sets - even if they have no operations in common (i.e. the intersection of their vectortimes is empty).