DBR's can be modified to allow freesite authors to update whenever they want. I will show this idea by example, so lets say someone inserts a DBR site at the following ascending times (in binary, and in an arbitrary time format):
1. 00110100 2. 00110101 3. 00111100 4. 00111111 5. 01001010 6. 01010100 The binary tree equivalents would be inserted as 1. 0 2. 00 3. 001 4. 0011 5. 01 6. 010 Basically, the next insert chopps off all of the ending uncommon bits with the last tree and then adds the most significant one that it does not share with the previous tree. If the current time is 01010010 then the algorithm will search for 01010010 0101001 010100 01010 0101 010 01 0 in order until it recieves one (or it could do several at once). After that, it tries to traverse down the tree to see if there are any newer versions. This may seem like a lot of overhead, but there are several optimizations that can be made with it. Scott Yourg _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl
