[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] Re: [MirageOS-devel] Irmin on BLOCK
Since it's for a project, take all of this with a pinch of salt: (random thoughts follow) A simple b-tree on disk would probably be much like an in-heap b-tree, except the nodes would be naturally wider and you would also need to track and reclaim free blocks (which the GC would normally do for you). You could do something really minimal at first (eg allocate by pointer bump, no deallocation) and then perhaps do a big stop-the-world thing (like fsck) and, if there's enough time, try something more incremental. Perhaps the "root" block would reference the tree root+a free list? You could also analyse or profile the costs in terms of disk seeks? If it were me, I'd be happier in a project implementing a relatively pure algorithm than binding together much bigger things (like baardskeerder) which were designed for something much bigger (eg clustering?) and where impedance mismatches are more likely. On Wed, 11 Nov 2015, 09:58ÂRupert Horlick <rh572@xxxxxxxxx> wrote:
_______________________________________________ MirageOS-devel mailing list MirageOS-devel@xxxxxxxxxxxxxxxxxxxx http://lists.xenproject.org/cgi-bin/mailman/listinfo/mirageos-devel
|
Lists.xenproject.org is hosted with RackSpace, monitoring our |