Messages in this thread | | | Date | Mon, 17 Jul 2006 23:08:53 -0400 | From | "Vishal Patil" <> | Subject | Re: Generic B-tree implementation |
| |
Agreed, however if I am not mistaken B-trees are useful even for virtual memory implementation, for example HP-UX uses B-trees for managing virtual memory pages.
Also I did not get the statement "Build infrastructure (== library) without clear users won't go very far on LKML"
- Vishal
On 7/17/06, Horst von Brand <vonbrand@inf.utfsm.cl> wrote: > Vishal Patil <vishpat@gmail.com> wrote: > > I am attaching source files containing a very generic implementation > > of B-trees in C. The implementation corresponds to in memory B-Tree > > data structure. The B-tree library consists of two files, btree.h and > > btree.c. I am also attaching a sample program main.c which should > > hopefully make the use of the library clear. > > B-trees are useful mainly when you can get a bunch of pointers in one > swoop, i.e., by reading nodes from disk. > > > I would be happy to receive inputs from the community for changes > > (enchancements) to the library. All the more I would like to help > > someone with a project which would take advantage of the B-Tree > > implementation. > > Build infrastructure (== library) without clear users won't go very far on > LKML. > -- > Dr. Horst H. von Brand User #22616 counter.li.org > Departamento de Informatica Fono: +56 32 654431 > Universidad Tecnica Federico Santa Maria +56 32 654239 > Casilla 110-V, Valparaiso, Chile Fax: +56 32 797513 >
-- Motivation will almost always beat mere talent. - 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/
| |