Messages in this thread | | | Subject | Re: Generic B-tree implementation | From | Anton Altaparmakov <> | Date | Wed, 19 Jul 2006 08:33:14 +0100 |
| |
On Tue, 2006-07-18 at 11:22 -0400, Vishal Patil wrote: > B-trees are good for parellel updates as well. Anyway it would be > great to have inputs from other folks about how B-trees could help > inside the kernel (if at all)
B-trees are mostly used in file systems in the kernel. For example NTFS and HFS (and I think HPFS) use B-trees for various metadata like directory indexes for example.
But of course your implementation is purely userspace and cannot be used in the kernel (you use recursion for example...) so I am not sure how you envisage to help the kernel with your code...
Best regards,
Anton -- Anton Altaparmakov <aia21 at cam.ac.uk> (replace at with @) Unix Support, Computing Service, University of Cambridge, CB2 3QH, UK Linux NTFS maintainer / IRC: #ntfs on irc.freenode.net WWW: http://linux-ntfs.sf.net/ & http://www-stu.christs.cam.ac.uk/~aia21/
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |