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/15
Message-ID: <355CC85E.AE8329B1@earthling.net>#1/1
X-Deja-AN: 353661785
Content-Transfer-Encoding: 7bit
References: <6je5il$ecf$1@news.iinet.net.au> <355B0B39.7A3673D5@earthling.net>
 <dewar.895192005@merv>
To: Robert Dewar <dewar@merv.cs.nyu.edu>
Content-Type: text/plain; charset=us-ascii
Organization: http://extra.newsguy.com
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 1998-05-15T00:00:00+00:00
List-Id: <comp.lang.ada>


Yes, he explains a lot.  But I kept finding that I had to drop into MIX
to figure out EXACTLY what he meant, and if one is implementing a
B-Tree, the EXACTLY is precisely what is wanted.

Robert Dewar wrote:
> 
> Charles says
> 
> <<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!
> >>
> 
> This is quite unfair to Don, he explains algorithms in a high level
> manner using abstract pseudo-code. MIX is only used in low level analysis
> of actual performance on a typical machine, i.e. to get a feel for the
> constants involved and go from O(n**2) to C*n**2, you need a concrete
> machine!

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