Just a quick thought inspired by what Oskar was saying earlier. Couldn't you use one B+tree to store local storage references *and* routing information? The pointers within the tree could point to either:
* local non-leaf nodes (with their own lists of key values and pointers, blah) * local leaf nodes (files) * non-local nodes, ie the root node of the B+tree on another freenet node Sorry for the overloading of "node" there... but it turns out to be appropriate. A search through freenet would be a search through one huge B+tree. (Well not really a tree, since there's the possibility of loops... but if you avoid those by using unique request numbers, it acts like a tree.) Sorry if this is obvious and I've only just become enlightened. :) Michael _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
