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,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: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Help B* and B+ Trees
Date: 1998/05/14
Message-ID: <dewar.895192161@merv>#1/1
X-Deja-AN: 353358131
References: <6je5il$ecf$1@news.iinet.net.au>
 <matthew_heaney-ya023680001405980953080001@news.ni.net>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 895192240 28063 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1998-05-14T00:00:00+00:00
List-Id: <comp.lang.ada>


<<In article <6je5il$ecf$1@news.iinet.net.au>, "whizzbang" <none@present.com>
wrote:
(start of quote)
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.
(end of quote)
>>


I recomend going back to the original B-Tree paper (as always Knuth is
careful with references, so you can find the refrefrence in Vol III).
It is one of the really great papers in the computer science literature,
since it not only presents a critical idea that has been widely used, but
does it in a very understandable and very thorough manner.