Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site ut-dillo.UUCP
Path: utzoo!watmath!clyde!bonnie!akgua!gatech!ut-sally!ut-ngp!ut-dillo!darin
From: darin@ut-dillo.UUCP (Darin Adler)
Newsgroups: net.unix
Subject: Re: B-trees
Message-ID: <212@ut-dillo.UUCP>
Date: Mon, 2-Dec-85 17:08:32 EST
Article-I.D.: ut-dillo.212
Posted: Mon Dec  2 17:08:32 1985
Date-Received: Thu, 5-Dec-85 04:31:53 EST
References: <4590@alice.UUCP> <28400004@ISM780B.UUCP>
Organization: UTexas Computation Center, Austin, Texas
Lines: 15

<>

Aside from sarcastic remarks about B-trees, someone wanted to know
what they were, an what relationship they had to binary trees.
B-trees are a more general case of the type of tree that a binary tree
is.  They allow any given number of children per node.  They are, by
definition, always balanced.  In addition, since the number of
children can be adjusted, the nodes can be made any size.  It is often
useful to make the size of a single node equal to the block size of
the mass storage device that the B-tree is stored on.  This will help
minimize the number of disk accesses.  (A similar thing can be done
with virtual memory, if you know the appropriate block size.)
-- 
Darin Adler
{gatech,harvard,ihnp4,seismo}!ut-sally!ut-dillo!darin