[aclug-L] Re: B-Tree implementation

[Tom Hull <thull@xxxxxxxxxxx>]

I've only seen B-Trees used for external storage, where you want to
minimize disk accesses. If you want something in-memory, why not just
use AVL trees?

For AVL trees, see:

  http://www.msu.edu/user/pfaffben/avl/

In general, 

  http://www.rocketaware.com/

attempts to catalog every conceivable piece of re-usable source code,
plus references to everything of interest to programmers. Unfortunately,
their search engine treats "b-tree" as the union of documents containing
"b" and/or "tree". I wasn't motivated to wade through them.

For disk-based B-trees, I did find:

  http://www.semaphorecorp.com/btp/btp.html

A couple of sections on algorithms look reasonable.

John Reinke wrote:
> 
> This is slightly off-topic, but I guess I'll be running this on Linux...
> 
> I'm looking for an implementation of a B-Tree. I'd prefer it if is in C,
> and it should be memory-based. I need this for an assignment I'm working on
> - and we can use any code we want. It doesn't have to be fancy, either. I
> haven't been successful searching for it online, and perhaps someone knows
> of a source for algorithm implementations online.
> 
> Thanks.
> John
> 
> -- This is the discussion@xxxxxxxxx list.  To unsubscribe,
> visit http://tmp2.complete.org/cgi-bin/listargate-aclug.cgi

-- 
/*
 *  Tom Hull * thull@xxxxxxxxxxx * http://www.ocston.org/~thull/
 */

-- This is the discussion@xxxxxxxxx list.  To unsubscribe,
visit http://tmp2.complete.org/cgi-bin/listargate-aclug.cgi