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/16
Message-ID: <dewar.895324054@merv>#1/1
X-Deja-AN: 353792449
References: <6je5il$ecf$1@news.iinet.net.au> <355B0B39.7A3673D5@earthling.net>
 <dewar.895192005@merv> <355CC85E.AE8329B1@earthling.net>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 895324177 16143 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1998-05-16T00:00:00+00:00
List-Id: <comp.lang.ada>


Charles said

<<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.
>>

Well of course I can't argue with what Charles needed to do, but in my view
the description of B-Tree's in KnuthV3 is complete and accurate. The MIX
code adds nothing but over-specification and confusion in this particular
case if you ask me! Certainly most readers will not need to read the Mix
code. I have taught hundreds of students using this book, and one of my
important pieces of advice is to completely ignore the Mix stuff!