On Thursday 21 January 2010 12:09:39 Ximin Luo wrote: > On 01/21/2010 10:35 AM, alex wrote: > > > Another guess is that, given a "snapshot" of the tree, with few insertions > > you can give a new root (CHK or USK, whatever) that points to the updated > > data. Basically, "forking" the tree is a cheap operation. I'm on the right > > track? This would answer my question four paragraphs back. > > Yes
Cheap forking opens up all manner of interesting workflow possibilities IMHO. > > > And the ice in the cake is that searching any of these trees is made in > > logarithmic count of key retrievals, right? > > Yes :) Not the icing on the cake, this is fundamental, at least for freesite searches. We want them to be as fast as possible. Of course we can't preload everything if it's big - but we can preload the top few layers.
signature.asc
Description: This is a digitally signed message part.
_______________________________________________ Devl mailing list [email protected] http://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
