> so, I was thinking of something similar as described in this > paper [1] or similar [2]. since a B-tree is basically an ordered > list of items we'd have to linearize the JCR or MK hierarchy. I'm > not sure whether a depth or breadth first traversal is > better suited. maybe there even exists a more sophisticated > space filling curve, which is a combination of both.
I was thinking about this a bit more and came to the conclusion that a breadth first linearization works better for the usage imposed by the JCR API (direct lookup and looping through child nodes). Regards Marcel
