Hi
6 years ago I had some questions re " Scalability of UUID 2 Path resolving"
http://mail-archives.apache.org/mod_mbox/jackrabbit-dev/200608.mbox/%3c90a8d1c00608110549t7544f9edu2adae11c146fb...@mail.gmail.com%3E
It seems that the at that time referenced implementation
http://svn.apache.org/viewvc/jackrabbit/trunk/jackrabbit-core/src/main/java/org/apache/jackrabbit/core/CachingHierarchyManager.java?view=log
is still used.
What is not exactly clear to me from the code is whether this
implementation is also used for revisions of a node?
I mean a particular node could have had different paths at different
times, right?
Any hints/pointers are much appreciated.
Thanks
Michael
