Since a B-Tree is a single root structure, yes, he migrates from a pure B-Tree to a multiple-root structure, but it does appear that it is somewhat of a modified B-Tree.
Unix/Linux file systems pose an interesting dilema. In the past, there was an array with an inode being the root for file (or directory). And as Matthew mentions, hard links pose a problem. On 03/28/2014 10:07 AM, Mike Small wrote: > Jerry Feldman <[email protected]> writes: > >> I'm a fan of btree file systems going back to the 1970s. IBM used it on >> their mainframes (VSAM) back then. >> > Funny, I was just reading how Matthew Dillon intends to change from using > btree in Hammer 1 to something else in Hammer 2: > http://gitweb.dragonflybsd.org/dragonfly.git/blob_plain/HEAD:/sys/vfs/hammer2/DESIGN > (via http://www.shiningsilence.com/dbsdlog/2014/03/18/13651.html) > > I don't pretend to understand the implications or pretty much anything > in that design document, just thought you might find it interesting. > -- Jerry Feldman <[email protected]> Boston Linux and Unix PGP key id:3BC1EB90 PGP Key fingerprint: 49E2 C52A FC5A A31F 8D66 C0AF 7CEA 30FC 3BC1 EB90
_______________________________________________ Discuss mailing list [email protected] http://lists.blu.org/mailman/listinfo/discuss
