On Wed, July 16, 2008 18:25, Matthew Dillon wrote: > But the reblocking doesn't scan by block, it scans the B-Tree. So, > due to fragmentation, reblocking by scanning the B-Tree might free up > *some* of the space in each of those 16 blocks while filling up a new > block, but the new block may become completely full before any one of those > 16 blocks becomes completely empty. So another new block needs > to be allocated.
Oh I see, that's in clear contrast to LFS. Is it possible to find all b-tree elements (or rather, their parents) when looking at one block? cheers simon
