Hi, Since the new datastore can span across several files, wouldn't it be slightly better for searching and fragmentation of the datastore to distribute the stored keys across the volumes?
A very rough example would be to span the datastore on 16 files, and store keys starting with 0 on the first file, with 1 on the second, and so on, storing keys starting with with F on the last. Most of the keys will eventually be close to each other and then maybe a dynamic scheme for re-distributing keys between volumes could be implemented. Of course if its possible, adding new volumes or dynamically increasing/shrinking the size of the individual volumes would be better. _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl
