Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!wuarchive!uunet!munnari.oz.au!bunyip.cc.uq.oz.au!marlin.jcu.edu.au!mawwr
From: mawwr@marlin.jcu.edu.au (Wayne Read)
Newsgroups: comp.databases
Subject: B+ & B* trees
Summary: To B+ or not to B*: that is the question
Keywords: B+ tree, B* tree, indexed files
Message-ID: <1991May31.011948.28859@marlin.jcu.edu.au>
Date: 31 May 91 01:19:48 GMT
Organization: James Cook University
Lines: 10

I have just been reading the introductory text "File Structures: An
Analytic Approach" by Betty Salzberg, a very well written book.
In the chapter on B trees, she makes the statement that B+ trees are the
only version used in practice, and that B trees and B* trees (min 66%
storage utilisation) are of theoretical interest only.  Can anyone help
me with references etc - I was under the impression that B* trees were
used in less dynamic situations, where the extra cost of insertions and
deletations are of lesser importance.  Maybe a hybrid B+ &  B* tree is
used in these situations?  Thanks in advance for any replies.
                        Wayne Read