From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,FREEMAIL_FROM,
	INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,5cbfcb03a9d3d935
X-Google-Attributes: gid103376,public
From: Charles Hixson <charleshixson@earthling.net>
Subject: Re: Help B* and B+ Trees
Date: 1998/05/14
Message-ID: <355B0B39.7A3673D5@earthling.net>#1/1
X-Deja-AN: 353237167
Content-Transfer-Encoding: 7bit
References: <6je5il$ecf$1@news.iinet.net.au>
Mime-Version: 1.0
To: whizzbang <none@present.com>
Content-Type: text/plain; charset=us-ascii
Organization: http://extra.newsguy.com
Newsgroups: comp.lang.ada
Date: 1998-05-14T00:00:00+00:00
List-Id: <comp.lang.ada>


Well... depending on your level of expertise, Knuth wrote the book on
this one.  Warning: He uses assembly code for a pseudo-machine in his
explanations!
I forget whether it's "Fundamental Algorithms" or "Sorting and
Searching", but it's one of the volumes of "The Art of Computer
Programming".

whizzbang wrote:
> 
> Can anyone please help me on information regarding B-Plus & B-Star Trees. I
> am not after code, but I am after documentation on how they work. I f anyone
> has any interesting information I will be more than greatfull. You can email
> me on:
> ryan@gic.net.au
> Thank you
> Ryan Froman

-- 
Charles Hixson	charleshixson@earthling.net
(510) 464-7733	or chixso@mtc.dst.ca.us