On Fri, 4 Aug 2000, Oskar Sandberg wrote: > However, that is NOT the problem with DataStore design. Looking up > data in a list is probably the oldest problem in CS and we could > probably find a million examples of people having done it before. The > hard part in the DataStore is the routing, being able to find the > "closest" key and it's reference, as well as the nth-closest should > that fail. This is not a case where I am aware of much prior art (I've > wondered a bit about spell checkers, if anybody knows anything else I > would be very interested).
I could be a little confused about the problem domain here, but it's my impression that freenet doesn't have to be anywhere near fully connected - with even a million nodes, it would function quite happily with each node only talking to a hundred or so 'neigbors' and using a hops to live of six or seven, so long as who any given node's neigbors were was reasonably 'random'. Having that few neigbors reduces the problem size to one where even linear search would work fine. The circular comparison, by the way, is a special case, and I don't think the topology of the comparison space is likely to become any more complicated. I did find the code for doing keys a bit confusing - If all that's being used for keys are SHA1 hashes, why aren't they just byte arrays of length 20? -Bram Cohen _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
