Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!henry
From: henry@utzoo.UUCP (Henry Spencer)
Newsgroups: net.unix
Subject: Re: B-trees
Message-ID: <6194@utzoo.UUCP>
Date: Sat, 30-Nov-85 20:37:01 EST
Article-I.D.: utzoo.6194
Posted: Sat Nov 30 20:37:01 1985
Date-Received: Sat, 30-Nov-85 20:37:01 EST
References: <4590@alice.UUCP>, <28400004@ISM780B.UUCP>
Organization: U of Toronto Zoology
Lines: 17

> > B-trees are to binary trees what ksh is to sh.
> 
> Does this mean that B-trees are something that every binary tree user
> would want to use, or does it mean that they take up a lot of space to
> add functionality that should be done in another way?

It means that they are far more complex and should not automatically be
considered a preferred alternative, even though they definitely do have
certain advantages.

> Also, what data structures correspond to csh and the 8th edition sh? :-)

Csh is probably a hash table that everyone has forgotten the hashing function
for.  The V8 sh... maybe balanced or semi-balanced binary trees?
-- 
				Henry Spencer @ U of Toronto Zoology
				{allegra,ihnp4,linus,decvax}!utzoo!henry