Because XML documents tend to be very large and are more and more
collaboratively processed, their fine-grained storage and management is a \textit{must}
for which, in turn, a flexible tree representation is mandatory. Performance requirements
dictate efficient query and update processing in multi-user environments.
For this reason, three aspects are of particular importance: index support
to directly access each internal document node if needed, navigation along
the parent, child, and sibling axes, selective and direct locking of minimal document
granules. The secret to effectively accelerate all of them are DeweyIDs.
They identify the tree nodes, avoid relabeling of them even under heavy node insertions
and deletions, and allow, at the same time, the derivation of all ancestor
node IDs without accessing the document. In this paper, we explore the concept
of DeweyIDs, refine the OrdPath addressing scheme, illustrate its implementation,
and give an exhaustive performance evaluation of its practical use.