Weekly edition	Kernel	Security	Distributions	Contact Us	Search
Archives	Calendar	Subscribe	Write for LWN	LWN.net FAQ	Sponsors

Replace flexible arrays with unsorted b+trees?

Posted Aug 7, 2009 19:12 UTC (Fri) by johill (subscriber, #25196)
In reply to: Replace flexible arrays with unsorted b+trees? by zlynx
Parent article: Flexible arrays

I worked on the b+tree implementation for a while, and then we measured it but it turned out to be slower than using an rbtree, for some reason, so I don't think the b+tree got into the tree at this point. I might be wrong and have missed that tho.

(Log in to post comments)

Posted Aug 20, 2009 18:29 UTC (Thu) by mfedyk (guest, #55303) [Link]

I believe the OP was referring to btrfs which uses a modified b+tree structure.

Also NTFS, ReiserFS, NSS, XFS, and JFS use B+trees. I wonder if it has been implemented in a library or if there are 5 or 6 differing implementations of b+trees in the kernel...